Sciweavers

5198 search results - page 1013 / 1040
» A Logic of Agent Programs
Sort
View
VMCAI
2004
Springer
14 years 21 days ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
VMCAI
2004
Springer
14 years 21 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
CF
2010
ACM
14 years 13 days ago
Interval-based models for run-time DVFS orchestration in superscalar processors
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
Georgios Keramidas, Vasileios Spiliopoulos, Stefan...
BIRTHDAY
2010
Springer
14 years 5 days ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
ICALP
1998
Springer
13 years 11 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
« Prev « First page 1013 / 1040 Last » Next »