168 search results - page 2 / 34 » Imperative Program Transformation by Rewriting |
157
click to vote
BIRTHDAY
1994
Springer
15 years 10 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
162
click to vote
ENTCS
2008
15 years 6 months ago
2008
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
193
Voted
SIGADA
2007
Springer
16 years 23 days ago
2007
Springer
Teaching beginners predicate transformer semantics for imperative languages is not a trivial task. For Computer Science majors, the teaching of the theoretical material must be su...
200
click to vote
POPL
1997
ACM
15 years 10 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
220
click to vote
JAR
2008
15 years 6 months ago
2008
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...