output
19932026
most citedQuantum ESPRESSO: a modular and open-source software project for quantum simulations of materials

29.3k citations

Showing 2017 · cs.LOShow all

8 papers · 2 filters

cs.LO2017★ 13 cited

Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison

Laura Bozzelli, Alberto Molinari, Angelo Montanari +2

In the last years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, C…

cs.LO2017★ 1 cited

Beyond BS-regular Languages: T-regular Expressions and Counter-Check Automata

Dario Della Monica, Angelo Montanari, Pietro Sala

In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular…

cs.LO2017★ 17 cited

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

Laura Bozzelli, Alberto Molinari, Angelo Montanari +1

In this paper, we investigate the model checking (MC) problem for Halpern and Shoham's interval temporal logic HS. In the last years, interval temporal logic MC has received an inc…

cs.LO2017★ 10 cited

Model Checking for Fragments of Halpern and Shoham's Interval Temporal Logic Based on Track Representatives

Alberto Molinari, Angelo Montanari, Adriano Peron

Model checking allows one to automatically verify a specification of the expected properties of a system against a formal model of its behaviour (generally, a Kripke structure). Po…

cs.LO2017

Loose Graph Simulations

Alessio Mansutti, Marino Miculan, Marco Peressotti

We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern m…

cs.LO2017★ 31 cited

An Active Learning Approach to the Falsification of Black Box Cyber-Physical Systems

Simone Silvetti, Alberto Policriti, Luca Bortolussi

Search-based testing is widely used to find bugs in models of complex Cyber-Physical Systems. Latest research efforts have improved this approach by casting it as a falsification p…

cs.LO2017★ 1 cited

Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation

Marino Miculan, Marco Peressotti

Weighted labelled transition systems (WLTSs) are an established meta-model aiming to provide general results and tools for a wide range of systems such as non-deterministic, stocha…

cs.LO2017★ 10 cited

: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads

Furio Honsell, Luigi Liquori, Petar Maksimovic +1

We extend the constructive dependent type theory of the Logical Framework with monadic, dependent type constructors indexed with predicates over judgements, called Lo…