56 citations · 85 across the 9 of their papers we have counts for
9 papers
A parallel parser for regular expressions
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi +1
Regular expression (RE) matching is a very common functionality that scans a text to find occurrences of patterns specified by an RE; it includes the simpler function of RE recogni…
Minimizing speculation overhead in a parallel recognizer for regular texts
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi +1
Speculative data-parallel algorithms for language recognition have been widely experimented for various types of finite-state automata (FA), deterministic (DFA) and nondeterministi…
Lecture Notes on Monadic First- and Second-Order Logic on Strings
Dino Mandrioli, Davide Martinenghi, Angelo Morzenti +2
These notes present the essentials of first- and second-order monadic logics on strings with introductory purposes. We discuss Monadic First-Order logic and show that it is strictl…
Parsing methods streamlined
Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti
This paper has the goals (1) of unifying top-down parsing with shift-reduce parsing to yield a single simple and consistent framework, and (2) of producing provably correct parsing…
Non-null Infinitesimal Micro-steps: a Metric Temporal Logic Approach
Luca Ferrucci, Dino Mandrioli, Angelo Morzenti +1
Many systems include components interacting with each other that evolve with possibly very different speeds. To deal with this situation many formal models adopt the abstraction of…
Constraint LTL Satisfiability Checking without Automata
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti +3
This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic for…
Bounded Reachability for Temporal Logic over Constraint Systems
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti +3
We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint…
A Metric Encoding for Bounded Model Checking (extended version)
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique…
Modeling Time in Computing: A Taxonomy and a Comparative Survey
Carlo A. Furia, Dino Mandrioli, Angelo Morzenti +1
The increasing relevance of areas such as real-time and embedded systems, pervasive computing, hybrid systems control, and biological and social systems modeling is bringing a grow…