Sciweavers

4743 search results - page 367 / 949
» The PlusCal Algorithm Language
Sort
View
ESOP
2001
Springer
15 years 9 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
CHARME
2005
Springer
133views Hardware» more  CHARME 2005»
15 years 10 months ago
Symbolic Partial Order Reduction for Rule Based Transition Systems
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. In this paper, we develop a partial order reduction algorithm for rule-bas...
Ritwik Bhattacharya, Steven M. German, Ganesh Gopa...
CP
2005
Springer
15 years 10 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
PPDP
2005
Springer
15 years 10 months ago
Trace effects and object orientation
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
Christian Skalka
PPDP
2004
Springer
15 years 10 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey