Sciweavers

149 search results - page 29 / 30
» Abstract Model Checking of Infinite Specifications
Sort
View
CONCUR
2006
Springer
13 years 9 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
IJFCS
2006
119views more  IJFCS 2006»
13 years 5 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
ICOODB
2009
246views Database» more  ICOODB 2009»
13 years 2 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
EMSOFT
2006
Springer
13 years 8 months ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...
BIRTHDAY
2010
Springer
13 years 10 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem