Sciweavers

1486 search results - page 189 / 298
» A Logically Saturated Extension of
Sort
View
VMCAI
2010
Springer
16 years 3 months ago
Shape Analysis with Reference Set Relations
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
16 years 27 days ago
Arithmetic optimization for custom instruction set synthesis
Abstract—One of the ways that custom instruction set extensions can improve over software execution is through the use of hardware structures that have been optimized at the arit...
Ajay K. Verma, Yi Zhu, Philip Brisk, Paolo Ienne
KBSE
2008
IEEE
16 years 17 days ago
Inferring Finite-State Models with Temporal Constraints
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
Neil Walkinshaw, Kirill Bogdanov
FMICS
2007
Springer
16 years 10 days ago
An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications
Abstract. In this paper we present an action/state-based logical framework for the analysis and verification of complex systems, which relies on the definition of doubly labelled...
Maurice H. ter Beek, Alessandro Fantechi, Stefania...
LPNMR
2007
Springer
16 years 9 days ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...