Sciweavers

344 search results - page 47 / 69
» Formal Verification of Floating-Point Programs
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
ENTCS
2002
107views more  ENTCS 2002»
13 years 7 months ago
Monitoring, Checking, and Steering of Real-Time Systems
The MaC system has been developed to provide assurance that a target program is running correctly with respect to formal requirements specification. This is achieved by monitoring...
Moonjoo Kim, Insup Lee, Usa Sammapun, Jangwoo Shin...
POPL
2007
ACM
14 years 8 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
FOSSACS
2008
Springer
13 years 9 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
POPL
2000
ACM
13 years 11 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu