Sciweavers

3335 search results - page 458 / 667
» Grid result checking
Sort
View
ASE
2002
160views more  ASE 2002»
15 years 5 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
CC
2002
Springer
145views System Software» more  CC 2002»
15 years 5 months ago
Forwarding in Attribute Grammars for Modular Language Design
Abstract. Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular implementation of programming languages. It com...
Eric Van Wyk, Oege de Moor, Kevin Backhouse, Paul ...
JAIR
2000
96views more  JAIR 2000»
15 years 5 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
SCFBM
2008
91views more  SCFBM 2008»
15 years 5 months ago
Simple tools for assembling and searching high-density picolitre pyrophosphate sequence data
Background: The advent of pyrophosphate sequencing makes large volumes of sequencing data available at a lower cost than previously possible. However, the short read lengths are d...
Nicolas J. Parker, Andrew G. Parker
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
15 years 4 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...