Sciweavers

1422 search results - page 60 / 285
» Complementation in Abstract Interpretation
Sort
View
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 10 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
VL
2003
IEEE
169views Visual Languages» more  VL 2003»
15 years 10 months ago
Additional context for gentle-slope systems
Interpreting general purpose programming constructs can be difficult because it requires context, such as knowledge of language syntax or idioms, which users may not have readily ...
Yasunori Harada, Richard Potter
DATE
2010
IEEE
138views Hardware» more  DATE 2010»
15 years 10 months ago
Checking and deriving module paths in Verilog cell library descriptions
—Module paths are often used to specify the delays of cells in a Verilog cell library description, which define the propagation delay for an event from an input to an output. Sp...
Matthias Raffelsieper, Mohammad Reza Mousavi, Chri...
165
Voted
CSFW
2007
IEEE
15 years 8 months ago
Secure information flow and program logics
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
Lennart Beringer, Martin Hofmann
IJCAI
1997
15 years 6 months ago
Challenges in Bridging Plan Synthesis Paradigms
In the last three years, several “radically new” and promising approaches have been developed for tackling the plan synthesis problem. Currently, these approaches exist in iso...
Subbarao Kambhampati