Sciweavers

197 search results - page 15 / 40
» Reduction Semantics and Formal Analysis of Orc Programs
Sort
View
IPL
2007
78views more  IPL 2007»
13 years 7 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
ICCD
2005
IEEE
124views Hardware» more  ICCD 2005»
14 years 1 months ago
Model Checking C Programs Using F-SOFT
— With the success of formal verification techniques like equivalence checking and model checking for hardware designs, there has been growing interest in applying such techniqu...
Franjo Ivancic, Ilya Shlyakhter, Aarti Gupta, Mala...
PLDI
2004
ACM
14 years 1 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
IBERAMIA
2004
Springer
14 years 1 months ago
Towards CNC Programming Using Haskell
Recent advances in Computerized Numeric Control (CNC) have allowed the manufacturing of products with high quality standards. Since CNC programs consist of a series of assembler-li...
Gustavo Arroyo, Claudio Ochoa, Josep Silva, Germ&a...
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 10 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal