Sciweavers

139 search results - page 6 / 28
» Modular difference logic is hard
Sort
View
CONCUR
2010
Springer
14 years 10 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
ATAL
2010
Springer
14 years 10 months ago
An architecture for modular distributed simulation with agent-based models
Agent-based simulations are an increasingly popular means of exploring and understanding complex social systems. In order to be useful, these simulations must capture a range of a...
David Scerri, Alexis Drogoul, Sarah L. Hickmott, L...
ICFP
2005
ACM
15 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
DEON
2010
Springer
15 years 5 hour ago
A Logical Model of Private International Law
We provide a logical analysis of private international law, the body of law establishing when courts of a country should decide a case (jurisdiction) and what legal system they sho...
Phan Minh Dung, Giovanni Sartor
OWLED
2008
14 years 11 months ago
The OWL in the CASL - Designing Ontologies Across Logics
Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETC...
Oliver Kutz, Dominik Lücke, Till Mossakowski,...