4047 search results - page 416 / 810 » Algebraic Model Checking |
216
click to vote
FOSSACS
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
155
click to vote
AGP
1993
IEEE
15 years 11 months ago
1993
IEEE
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
165
Voted
BSL
1999
15 years 6 months ago
1999
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...
188
click to vote
ECBS
2003
IEEE
16 years 3 days ago
2003
IEEE
System families are a form of high level reuse of development assets in a specific problem domain, by making use of commonalities and variabilities. To represent assets belonging ...
171
click to vote
KBSE
2002
IEEE
15 years 11 months ago
2002
IEEE
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...