Sciweavers

950 search results - page 178 / 190
» Software model checking with SPIN
Sort
View
HIPC
2007
Springer
14 years 15 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DAC
2005
ACM
13 years 10 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
IJFCS
2006
119views more  IJFCS 2006»
13 years 8 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
ENTCS
2002
145views more  ENTCS 2002»
13 years 8 months ago
Combining Monitors for Runtime System Verification
Runtime verification permits checking system properties that cannot be fully verified off-line. This is particularly true when the system includes complex third-party components, ...
Joshua Levy, Hassen Saïdi, Tomás E. Ur...
ICOODB
2009
246views Database» more  ICOODB 2009»
13 years 6 months ago
Compiler Plugins Can Handle Nested Languages: AST-Level Expansion of LINQ Queries for Java
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
Miguel Garcia