Sciweavers

4767 search results - page 868 / 954
» Structures for Abstract Rewriting
Sort
View
CAV
2010
Springer
194views Hardware» more  CAV 2010»
14 years 1 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
ER
2007
Springer
146views Database» more  ER 2007»
14 years 1 months ago
Achieving, Satisficing, and Excelling
Abstract. Definitions of the concepts derived from the goal concept (including functional and nonfunctional goal, hardgoal, and softgoal) used in requirements engineering are discu...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
EMSOFT
2006
Springer
14 years 1 months ago
Incremental schedulability analysis of hierarchical real-time components
Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This structure makes embedded systems amenable to composi...
Arvind Easwaran, Insik Shin, Oleg Sokolsky, Insup ...
FLOPS
2006
Springer
14 years 1 months ago
Convergence in Language Design: A Case of Lightning Striking Four Times in the Same Place
What will a definitive programming language look like? By definitive language I mean a programming language that gives good soat its level of abstraction, allowing computer science...
Peter Van Roy