Sciweavers

81 search results - page 13 / 17
» On the verification of polynomial system solvers
Sort
View
SIGSOFT
2008
ACM
15 years 10 months ago
Effective blame for information-flow violations
Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, cu...
Dave King 0002, Trent Jaeger, Somesh Jha, Sanjit A...
POPL
2009
ACM
15 years 10 months ago
Unifying type checking and property checking for low-level code
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, ...
APN
2006
Springer
15 years 1 months ago
Can I Execute My Scenario in Your Net? VipTool Tells You!
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, given...
Robin Bergenthum, Jörg Desel, Gabriel Juh&aac...
PPOPP
2010
ACM
15 years 6 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
IJFCS
2006
110views more  IJFCS 2006»
14 years 9 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang