Sciweavers

210 search results - page 25 / 42
» Definability and automorphisms in abstract logics
Sort
View
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
13 years 2 months ago
A symbolic approach to controlling piecewise affine systems
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
Jana Tumova, Boyan Yordanov, Calin Belta, Ivana Ce...
FASE
2008
Springer
13 years 9 months ago
An Algebraic Semantics for MOF
Abstract. Model-driven development is a field within software engineering in which software artifacts are represented as models in order to improve productivity, quality, and cost ...
Artur Boronat, José Meseguer
LATA
2010
Springer
14 years 5 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
VLSID
1999
IEEE
122views VLSI» more  VLSID 1999»
13 years 12 months ago
Formal Verification of an ARM Processor
This paper presents a detailed description of the application of a formal verification methodology to an ARM processor. The processor, a hybrid between the ARM7 and the StrongARM ...
Vishnu A. Patankar, Alok Jain, Randal E. Bryant
ISTA
2008
13 years 9 months ago
A Framework for Building Mapping Operators Resolving Structural Heterogeneities
Seamless exchange of models among different modeling tools increasingly becomes a crucial prerequisite for the success of modeldriven engineering. Current best practices use model ...
Gerti Kappel, Horst Kargl, Thomas Reiter, Werner R...