963 search results - page 132 / 193 » $M$-Solid Varieties of Languages |
ANSOFT
1998
13 years 8 months ago
1998
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...
LOGCOM
2010
13 years 3 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
SIGSOFT
2002
ACM
14 years 9 months ago
2002
ACM
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...