Sciweavers

1304 search results - page 84 / 261
» Model Checking C Programs Using F-SOFT
Sort
View
107
Voted
ASPLOS
2010
ACM
15 years 9 months ago
Dynamic filtering: multi-purpose architecture support for language runtime systems
This paper introduces a new abstraction to accelerate the readbarriers and write-barriers used by language runtime systems. We exploit the fact that, dynamically, many barrier exe...
Tim Harris, Sasa Tomic, Adrián Cristal, Osm...
140
Voted
AGP
2003
IEEE
15 years 8 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
109
Voted
ESOP
2001
Springer
15 years 7 months ago
Secure Information Flow and CPS
Security-typed languages enforce confidentiality or integrity policies by type checking. This paper investigates continuation-passing style (CPS) translation of such languages as ...
Steve Zdancewic, Andrew C. Myers
121
Voted
FM
2003
Springer
160views Formal Methods» more  FM 2003»
15 years 8 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan
105
Voted
TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
15 years 8 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....