Sciweavers

9405 search results - page 486 / 1881
» Computing a Model of Set Theory
Sort
View
ICSE
2010
IEEE-ACM
15 years 9 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro
AO
2007
119views more  AO 2007»
15 years 7 months ago
The model of roles within an ontology development tool: Hozo
One of the major goals of ontology is to represent properly the underlying conceptual structure of the messy world reflecting the reality as much as possible. Ontology building to...
Riichiro Mizoguchi, Eiichi Sunagawa, Kouji Kozaki,...
BIRTHDAY
2007
Springer
16 years 1 months ago
Superdeduction at Work
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
Paul Brauner, Clément Houtmann, Claude Kirc...
251
Voted
LICS
2012
IEEE
13 years 10 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
AI
2008
Springer
15 years 7 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar