Sciweavers

74 search results - page 6 / 15
» Partial Order Verification of Programmable Logic Controllers
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ECCB
2008
IEEE
13 years 7 months ago
Temporal logic patterns for querying dynamic models of cellular interaction networks
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
Pedro T. Monteiro, Delphine Ropers, Radu Mateescu,...
ENTCS
2007
87views more  ENTCS 2007»
13 years 7 months ago
A Study on the Practicality of Poly-Controlled Partial Evaluation
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global co...
Claudio Ochoa, Germán Puebla
HASE
1998
IEEE
13 years 12 months ago
Verification in Concurrent Programming with Petri Nets Structural Techniques
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
Kamel Barkaoui, Jean-François Pradat-Peyre
FOSSACS
2001
Springer
14 years 6 days ago
On Garbage and Program Logic
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
Cristiano Calcagno, Peter W. O'Hearn