Sciweavers

1000 search results - page 118 / 200
» Nominal rewriting systems
Sort
View
CSL
2007
Springer
14 years 4 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
BIRTHDAY
2005
Springer
14 years 3 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz
CCS
2005
ACM
14 years 3 months ago
Control-flow integrity
Current software attacks often build on exploits that subvert machine-code execution. The enforcement of a basic safety property, Control-Flow Integrity (CFI), can prevent such at...
Martín Abadi, Mihai Budiu, Úlfar Erl...
ICICS
2005
Springer
14 years 3 months ago
Network Vulnerability Analysis Through Vulnerability Take-Grant Model (VTG)
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
Hamid Reza Shahriari, Reza Sadoddin, Rasool Jalili...
PPDP
1999
Springer
14 years 2 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie