1633 search results - page 306 / 327 » On the Verification of Temporal Properties |
SIGSOFT
2003
ACM
16 years 15 days ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
109
click to vote
SIGSOFT
2003
ACM
16 years 15 days ago
2003
ACM
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
212
Voted
POPL
2009
ACM
16 years 12 days ago
2009
ACM
Speed improvements in today's processors have largely been delivered in the form of multiple cores, increasing the importance of ions that ease parallel programming. Software...
CAV
2009
Springer
16 years 9 days ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
196
Voted
POPL
2008
ACM
16 years 2 days ago
2008
ACM
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...