Sciweavers

1418 search results - page 95 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
PLDI
2012
ACM
13 years 6 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
144
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
DAGSTUHL
2003
15 years 5 months ago
The Autotelic Principle
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
Luc Steels
AGP
2003
IEEE
15 years 9 months ago
Enhancing Disjunctive Logic Programming for Ontology Specification
This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from othe...
Francesco Calimeri, Stefania Galizia, Massimo Ruff...