Sciweavers

884 search results - page 115 / 177
» The Linear Logic of Multisets
Sort
View
LPNMR
2001
Springer
14 years 1 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
MTDT
2000
IEEE
129views Hardware» more  MTDT 2000»
14 years 1 months ago
Using GLFSRs for Pseudo-Random Memory BIST
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Rece...
Michael Redeker, Markus Rudack, Thomas Lobbe, Dirk...
RTSS
1997
IEEE
14 years 1 months ago
On-the-fly symbolic model checking for real-time systems
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
Ahmed Bouajjani, Stavros Tripakis, Sergio Yovine
FSTTCS
2007
Springer
14 years 1 months ago
Efficient and Expressive Tree Filters
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
Michael Benedikt, Alan Jeffrey
DIAGRAMS
2004
Springer
14 years 27 days ago
Towards a Default Reading for Constraint Diagrams
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They were designed to complement the Unified Modeling Language in the development ...
Andrew Fish, John Howse