Results 261 to 270 of about 82,016 (303)
Some of the next articles are maybe not open access.
Journal of Logic and Computation, 1994
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
2009
The process algebra CSP is designed for specifying interactions between concurrent systems. In CSP, and related languages, concurrent processes synchronise on common events, while the internal operations of the individual processes are treated abstractly.
Robert Colvin, Ian J. Hayes
openaire +3 more sources
The process algebra CSP is designed for specifying interactions between concurrent systems. In CSP, and related languages, concurrent processes synchronise on common events, while the internal operations of the individual processes are treated abstractly.
Robert Colvin, Ian J. Hayes
openaire +3 more sources
Why Is CSP Failing? Trends and Challenges in CSP Adoption
2014Content Security Policy (CSP) has been proposed as a principled and robust browser security mechanism against content injection attacks such as XSS. When configured correctly, CSP renders malicious code injection and data exfiltration exceedingly difficult for attackers.
Michael Weissbacher +2 more
openaire +2 more sources
2000
Many works about abstraction of Constraint Satisfaction Problems (CSPs) introduce materials in order to build specific abstractions. But, to our best knowledge, only two works [2] [9] were devoted to defining frameworks of CSP abstraction. In this paper, we try to go one step beyond by proposing an original and unifying framework with a two-fold ...
Christophe Lecoutre +3 more
openaire +1 more source
Many works about abstraction of Constraint Satisfaction Problems (CSPs) introduce materials in order to build specific abstractions. But, to our best knowledge, only two works [2] [9] were devoted to defining frameworks of CSP abstraction. In this paper, we try to go one step beyond by proposing an original and unifying framework with a two-fold ...
Christophe Lecoutre +3 more
openaire +1 more source
Semiring-based CSPs and valued CSPs: Basic properties and comparison
1996In this paper we describe two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discuss the relationship between them.
Stefano Bistarelli +5 more
openaire +3 more sources
14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings., 2003
Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical
openaire +1 more source
Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical
openaire +1 more source
2000
In this paper, we introduce a new form of consistency in general constraint satisfaction problems (CSPs), called ω-pairwise-consistency which can be applied to both binary and non-binary constraints. Enforcing ω-pairwise-consistency in a CSP simplifies the problem representation by removing those tuples from the given constraints that will not ...
Wanlin Pang, Scott D. Goodwin
openaire +1 more source
In this paper, we introduce a new form of consistency in general constraint satisfaction problems (CSPs), called ω-pairwise-consistency which can be applied to both binary and non-binary constraints. Enforcing ω-pairwise-consistency in a CSP simplifies the problem representation by removing those tuples from the given constraints that will not ...
Wanlin Pang, Scott D. Goodwin
openaire +1 more source
2010
Hybrid Communicating Sequential Processes (HCSP) is an extension of CSP allowing continuous dynamics. We are interested in applying HCSP to model and verify hybrid systems. This paper is to present a calculus for a subset of HCSP as a part of our efforts in modelling and verifying hybrid systems. The calculus consists of two parts.
Jiang Liu 0009 +6 more
openaire +1 more source
Hybrid Communicating Sequential Processes (HCSP) is an extension of CSP allowing continuous dynamics. We are interested in applying HCSP to model and verify hybrid systems. This paper is to present a calculus for a subset of HCSP as a part of our efforts in modelling and verifying hybrid systems. The calculus consists of two parts.
Jiang Liu 0009 +6 more
openaire +1 more source
2013 IEEE Conference on Computational Complexity, 2013
Irit Dinur, Gillat Kol
openaire +3 more sources
Irit Dinur, Gillat Kol
openaire +3 more sources
2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2013
This second edition of CSP focuses on collaborative aspects of modeling and enactment of software development processes. It aims to provide an opportunity for the software engineering community to exchange ideas and to present emerging new technology and understanding in the field.
openaire +2 more sources
This second edition of CSP focuses on collaborative aspects of modeling and enactment of software development processes. It aims to provide an opportunity for the software engineering community to exchange ideas and to present emerging new technology and understanding in the field.
openaire +2 more sources