Sciweavers

272 search results - page 39 / 55
» Programming languages capturing complexity classes
Sort
View
DM
2007
125views more  DM 2007»
13 years 9 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
ICDT
1997
ACM
95views Database» more  ICDT 1997»
14 years 1 months ago
Type-Consistency Problems for Queries in Object-Oriented Databases
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
Yasunori Ishihara, Hiroyuki Seki, Minoru Ito
POPL
2012
ACM
12 years 5 months ago
Sound predictive race detection in polynomial time
Data races are among the most reliable indicators of programming errors in concurrent software. For at least two decades, Lamport’s happens-before (HB) relation has served as th...
Yannis Smaragdakis, Jacob Evans, Caitlin Sadowski,...
FMOODS
2008
13 years 11 months ago
Symbolic Step Encodings for Object Based Communicating State Machines
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
Jori Dubrovin, Tommi A. Junttila, Keijo Heljanko
ESOP
2005
Springer
14 years 3 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi