Marco Muñiz

Learn More
We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use(More)
The concept of hybrid automata provides a powerful framework to model and analyze real-world systems. Due to the structural complexity of hybrid systems it is important to ensure the <i>scalability</i> of analysis algorithms. We approach this problem by providing an effective generalisation of the recently introduced notion of <i>quasi-equal</i> clocks to(More)
We introduce the novel notion of quasi-equal clocks and use it to improve the verification time of networks of timed automata. Intuitively , two clocks are quasi-equal if, during each run of the system, they have the same valuation except for those points in time where they are reset. We propose a transformation that takes a network of timed au-tomata and(More)
classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Abstract. We present a new decidable logic(More)