Sciweavers

366 search results - page 72 / 74
» Reasoning about relational granulation in modal logics
Sort
View
CSL
2007
Springer
14 years 14 days ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
OOPSLA
2007
Springer
14 years 13 days ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
POPL
2010
ACM
14 years 3 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 6 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
KBSE
1999
IEEE
13 years 10 months ago
AML: An Architecture Meta-Language
The language AML is used to specify the semantics of architecture description languages, ADLs. It is a very primitive language, having declarations for only three constructs: elem...
David S. Wile