#### DMCA

## Towards an Effective Decision Procedure for LTL formulas with Constraints

Venue: | In 23rd Workshop on Logic-based methods in Programming Environments (WLPE 2013). CoRR abs/1308.2055 |

Citations: | 1 - 1 self |

### Citations

1761 | The Temporal Logic of Reactive and Concurrent Systems: - Manna, Pnueli - 1991 |

1011 | Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Logic of Programs.
- Clarke, Emerson
- 1981
(Show Context)
Citation Context ...partially supported by the eu (feder) and the Spanish mec/micinn, ref. tin 2010-21062-c02-02, and by Generalitat Valenciana, ref. prometeo2011/052. 2 M. Comini, L. Titolo, A. Villanueva introduced in =-=[3,16]-=- to automatically check if a finite-state system satisfies a given property. It consisted in an exhaustive analysis of the state-space of the system; thus the state-explosion problem is its main drawb... |

501 | Concurrent Constraint Programming,
- Saraswat, Rinard
- 1990
(Show Context)
Citation Context ...aradigm). 2 The small-step denotational semantics of tccp The tccp language [7] is particularly suitable to specify both reactive and time critical systems. As the other languages of the ccp paradigm =-=[17]-=-, it is parametric w.r.t. a cylindric constraint system which handles the data information of the program in terms of constraints. The computation progresses as the concurrent and asynchronous activit... |

145 |
Specification and verification of concurrent systems
- Queille, Sifakis
- 1982
(Show Context)
Citation Context ...partially supported by the eu (feder) and the Spanish mec/micinn, ref. tin 2010-21062-c02-02, and by Generalitat Valenciana, ref. prometeo2011/052. 2 M. Comini, L. Titolo, A. Villanueva introduced in =-=[3,16]-=- to automatically check if a finite-state system satisfies a given property. It consisted in an exhaustive analysis of the state-space of the system; thus the state-explosion problem is its main drawb... |

87 | Temporal concurrent constraint programming: Denotation, logic and applications
- Nielsen, Palamidessi, et al.
(Show Context)
Citation Context ...dure to check the validity of such formulas. The linear temporal logic used in this work is an adaptation of the propositional LTL logic to the concurrent constraint framework, following the ideas of =-=[15,8,9,18]-=-. It is expressive enough to represent the abstract semantics of tccp with much precision and we provide a decision procedure based on the tableaux method of [11,13]. As we show through this paper, th... |

48 | A timed concurrent constraint language
- Boer, Gabbrielli, et al.
- 2000
(Show Context)
Citation Context ...formation. One challenging characteristics of the ccp framework is that programs can manifest nonmonotonic behaviors, implying that standard approaches cannot be directly adapted. Within this family, =-=[7]-=- introduced the Timed Concurrent Constraint Language (tccp) by adding to the original ccp model the notion of time and the ability to capture the absence of information. With these features, one can s... |

43 | Abstract diagnosis
- Comini, Levi, et al.
- 1999
(Show Context)
Citation Context ... at the following time instant. 4 Abstract diagnosis of temporal properties Abstract diagnosis is a semantic based method to identify bugs in programs. It was originally defined for logic programming =-=[4]-=- and then extended to other paradigms [1,2,10,5]. This technique is based on the definition of an abstract semantics for the program which must be a sound approximation of its behavior. 6 M. Comini, L... |

25 |
A Temporal Logic for Reasoning about Timed Concurrent Constraint Programs
- Boer, Gabbrielli, et al.
- 2001
(Show Context)
Citation Context ...dure to check the validity of such formulas. The linear temporal logic used in this work is an adaptation of the propositional LTL logic to the concurrent constraint framework, following the ideas of =-=[15,8,9,18]-=-. It is expressive enough to represent the abstract semantics of tccp with much precision and we provide a decision procedure based on the tableaux method of [11,13]. As we show through this paper, th... |

24 | Abstract Diagnosis of Functional Programs
- Alpuente, Comini, et al.
- 2003
(Show Context)
Citation Context ...t diagnosis of temporal properties Abstract diagnosis is a semantic based method to identify bugs in programs. It was originally defined for logic programming [4] and then extended to other paradigms =-=[1,2,10,5]-=-. This technique is based on the definition of an abstract semantics for the program which must be a sound approximation of its behavior. 6 M. Comini, L. Titolo, A. Villanueva Then, given an abstract ... |

18 |
Decidability of infinite-state timed CCP processes and first-order LTL
- Valencia
- 2005
(Show Context)
Citation Context ...dure to check the validity of such formulas. The linear temporal logic used in this work is an adaptation of the propositional LTL logic to the concurrent constraint framework, following the ideas of =-=[15,8,9,18]-=-. It is expressive enough to represent the abstract semantics of tccp with much precision and we provide a decision procedure based on the tableaux method of [11,13]. As we show through this paper, th... |

11 |
Proving correctness of Timed Concurrent Constraint Programs
- Boer, Gabbrielli, et al.
(Show Context)
Citation Context |

8 | Declarative Diagnosis of Temporal Concurrent Constraint Programs
- Falaschi, Olarte, et al.
- 2007
(Show Context)
Citation Context ...t diagnosis of temporal properties Abstract diagnosis is a semantic based method to identify bugs in programs. It was originally defined for logic programming [4] and then extended to other paradigms =-=[1,2,10,5]-=-. This technique is based on the definition of an abstract semantics for the program which must be a sound approximation of its behavior. 6 M. Comini, L. Titolo, A. Villanueva Then, given an abstract ... |

6 | A Cut-Free and Invariant-Free Sequent Calculus for - Gaintzarain, Hermo, et al. - 2007 |

5 | A Condensed Goal-Independent BottomUp Fixpoint Modeling the Behavior of tccp
- Comini, Titolo, et al.
- 2013
(Show Context)
Citation Context ...duce intuitively the most relevant aspects of such semantics and provide a global view of it by means of an example. The missing definitions, as well as the proofs of all the results, can be found in =-=[6]-=-. The denotational semantics of a tccp program consists of a set of conditional (timed) traces that represent, in a compact way, all the possible behaviors that the program can manifest when fed with ... |

4 |
Abstract Diagnosis for Timed Concurrent Constraint programs. TPLP
- Comini, Titolo, et al.
- 2011
(Show Context)
Citation Context ...goal is to define a method that avoids the need to build the model of a system in order to check the validity of some temporal property. We propose an extension of the abstract diagnosis technique of =-=[5]-=- so that the abstract domain is formed by LTL formulas. The final step of the method consists in checking whether a given formula, built from the program (abstract) semantics and the specification, is... |

3 | Abstract Diagnosis of First Order Functional Logic Programs
- Bacci, Comini
(Show Context)
Citation Context ...t diagnosis of temporal properties Abstract diagnosis is a semantic based method to identify bugs in programs. It was originally defined for logic programming [4] and then extended to other paradigms =-=[1,2,10,5]-=-. This technique is based on the definition of an abstract semantics for the program which must be a sound approximation of its behavior. 6 M. Comini, L. Titolo, A. Villanueva Then, given an abstract ... |

2 | Systematic semantic tableaux for PLTL
- Gaintzarain, Hermo, et al.
(Show Context)
Citation Context ...mework, following the ideas of [15,8,9,18]. It is expressive enough to represent the abstract semantics of tccp with much precision and we provide a decision procedure based on the tableaux method of =-=[11,13]-=-. As we show through this paper, the considered logic has some differences w.r.t. the classic LTL logic due to the constraint nature and to the fact that models for tccp programs have some special cha... |

1 |
Dual systems of tableaux and sequents for PLTL
- Gaintzarain, Hermo, et al.
(Show Context)
Citation Context ...mework, following the ideas of [15,8,9,18]. It is expressive enough to represent the abstract semantics of tccp with much precision and we provide a decision procedure based on the tableaux method of =-=[11,13]-=-. As we show through this paper, the considered logic has some differences w.r.t. the classic LTL logic due to the constraint nature and to the fact that models for tccp programs have some special cha... |