597 search results - page 53 / 120 » Formal Techniques for Java-Like Programs |
119
click to vote
FMCAD
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
117
Voted
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
120
click to vote
FOSAD
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
109
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...