Sciweavers

25 search results - page 5 / 5
» Verification and diagnosis of testing equivalence and reduct...
Sort
View
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
POPL
2010
ACM
14 years 4 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
FORMATS
2008
Springer
13 years 9 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
BMCBI
2005
124views more  BMCBI 2005»
13 years 7 months ago
Internet-based profiler system as integrative framework to support translational research
Background: Translational research requires taking basic science observations and developing them into clinically useful tests and therapeutics. We have developed a process to dev...
Robert Kim, Francesca Demichelis, Jeffery Tang, Al...
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck