Sciweavers

1948 search results - page 151 / 390
» Formalizing Mirror Theory
Sort
View
HEURISTICS
2006
102views more  HEURISTICS 2006»
15 years 6 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
JLP
2007
95views more  JLP 2007»
15 years 6 months ago
Model checking a cache coherence protocol of a Java DSM implementation
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java’s memory model and allows multithreaded Java progr...
Jun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald...
FM
2009
Springer
154views Formal Methods» more  FM 2009»
15 years 4 months ago
Specification and Verification of Web Applications in Rewriting Logic
Abstract. This paper presents a Rewriting Logic framework that formalizes the interactions between Web servers and Web browsers through icating protocol abstracting HTTP. The propo...
María Alpuente, Demis Ballis, Daniel Romero
HYBRID
2009
Springer
16 years 1 months ago
Actors without Directors: A Kahnian View of Heterogeneous Systems
This paper aims to simplify recent efforts proposed by the Berkeley school in giving a formal semantics to the Ptolemy toolbox. We achieve this by developing a simple and elegant ...
Paul Caspi, Albert Benveniste, Roberto Lublinerman...
SEMWEB
2009
Springer
16 years 1 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey