Sciweavers

2934 search results - page 289 / 587
» Universality in Multi-Agent Systems
Sort
View
SEUS
2010
IEEE
15 years 5 months ago
Time-Predictable Computing
Real-time systems need to be time-predictable in order to prove the timeliness of all their time-critical responses. While this is a well-known fact, recent efforts of the communit...
Raimund Kirner, Peter P. Puschner
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
16 years 1 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
WOLLIC
2009
Springer
16 years 1 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
HICSS
2007
IEEE
113views Biometrics» more  HICSS 2007»
16 years 29 days ago
Secure Software Engineering: A New Paradigm
Software defects lead to security vulnerabilities, which are costing businesses millions of dollars each year and threaten the security of individuals and the nation. It can be de...
Wm. Arthur Conklin, Glenn B. Dietrich
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
16 years 29 days ago
Online Education in Computer and Digital Forensics: A Case Study
Computer forensics is a relatively new, but growing, field of study at the undergraduate college and university level. This paper describes some of the course design aspects of te...
Gary C. Kessler