Sciweavers

17298 search results - page 242 / 3460
» Abstract computing machines
Sort
View
MFCS
2010
Springer
15 years 2 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
ASM
2005
ASM
15 years 9 months ago
Time in State Machines
State machines are considered a very general means of expressing computations in an implementation-independent way. There are also ways to extend the general state machine framewor...
Susanne Graf, Andreas Prinz
EUROMICRO
2004
IEEE
15 years 7 months ago
Intrusion Detection in Virtual Machine Environments
A virtual machine is a software replica of an underlying real machine. Multiple virtual machines can operate on the same host machine concurrently, without interfere each other. S...
Marcos Laureano, Carlos Maziero, Edgard Jamhour
DAC
2001
ACM
16 years 5 months ago
Formal Property Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines
roperty Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines Dong Wang , Pei-Hsin Ho , Jiang Long , James Kukula Yunshan Zhu , Tony Ma , Robert D...
Dong Wang, Pei-Hsin Ho, Jiang Long, James H. Kukul...
AAAI
2008
15 years 6 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm