Sciweavers

1763 search results - page 105 / 353
» A Formalization of Polytime Functions
Sort
View
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
14 years 4 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
HICSS
2008
IEEE
130views Biometrics» more  HICSS 2008»
15 years 4 months ago
Enterprise Modeling for Information System Development within MDA
Object-oriented analysis suggests semiformal usecase driven techniques for problem domain modeling from a computation independent viewpoint. The proposed approach called Topologic...
Janis Osis, Erika Asnina
MKM
2005
Springer
15 years 3 months ago
Translating Mathematical Vernacular into Knowledge Repositories
Abstract. Defining functions is a major topic when building mathematical repositories. Though relatively easy in mathematical vernacular, function definitions rise a number of qu...
Adam Grabowski, Christoph Schwarzweller
ATAL
2009
Springer
15 years 4 months ago
A logic of games and propositional control
We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outco...
Nicolas Troquard, Wiebe van der Hoek, Michael Wool...
FORMATS
2009
Springer
15 years 4 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas