Sciweavers

93 search results - page 13 / 19
» Nonterminal Complexity of Some Operations on Context-Free La...
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
FUIN
2006
128views more  FUIN 2006»
13 years 7 months ago
A Rewriting Framework for Rule-Based Programming Dynamic Applications
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
Anatoly E. Doroshenko, Ruslan Shevchenko
JPDC
2010
117views more  JPDC 2010»
13 years 6 months ago
Extensible transactional memory testbed
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...
CIC
2006
198views Communications» more  CIC 2006»
13 years 9 months ago
Communication Model to Support Rapid Application Development
Communication systems, along with database systems, have attracted a lot of attention in software engineering research. Encouraged by the success of SQL systems, some early effort...
Yingbo Wang, Peter J. Clarke, Yi Deng
DAGSTUHL
1996
13 years 8 months ago
Specialization of Imperative Programs Through Analysis of Relational Expressions
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
Alexander Sakharov