1686 search results - page 223 / 338 » Programs as polygraphs: computability and complexity |
168
click to vote
FOSSACS
2007
Springer
16 years 14 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
146
click to vote
ICALP
2007
Springer
16 years 14 days ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
135
click to vote
MSR
2006
ACM
16 years 7 days ago
2006
ACM
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
169
click to vote
CEC
2005
IEEE
15 years 12 months ago
2005
IEEE
AbstractSelf-Assembly is a powerful autopoietic mechanism ubiquitous throughout the natural world. It may be found at the molecular scale and also at astronomical scales. Self-asse...
183
click to vote
CALCO
2005
Springer
15 years 12 months ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...