Pierluigi San Pietro

According to our database1, Pierluigi San Pietro
  • authored at least 74 papers between 1991 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Counter machines, Petri Nets, and consensual computation.
Theor. Comput. Sci., 2017

A logical characterization of timed regular languages.
Theor. Comput. Sci., 2017

2016
A tool for deciding the satisfiability of continuous-time metric temporal logic.
Acta Inf., 2016

The Missing Case in Chomsky-Schützenberger Theorem.
Proceedings of the Language and Automata Theory and Applications, 2016

Efficient large-scale trace checking using mapreduce.
Proceedings of the 38th International Conference on Software Engineering, 2016

2015
An SMT-based approach to satisfiability checking of MITL.
Inf. Comput., 2015

Efficient Large-scale Trace Checking Using MapReduce.
CoRR, 2015

2014
Dense-choice Counter Machines revisited.
Theor. Comput. Sci., 2014

Constraint LTL satisfiability checking without automata.
J. Applied Logic, 2014

Commutative Languages and their Composition by Consensual Methods.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Offline Trace Checking of Quantitative Properties of Service-Based Applications.
CoRR, 2014

Offline Trace Checking of Quantitative Properties of Service-Based Applications.
Proceedings of the 7th IEEE International Conference on Service-Oriented Computing and Applications, 2014

A Logical Characterization of Timed (non-)Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

SMT-Based Checking of SOLOIST over Sparse Traces.
Proceedings of the Fundamental Approaches to Software Engineering, 2014

2013
Bounded satisfiability checking of metric temporal logic specifications.
ACM Trans. Softw. Eng. Methodol., 2013

Strict Local Testability with Consensus Equals Regularity, and Other Properties.
Int. J. Found. Comput. Sci., 2013

On the Satisfiability of Metric Temporal Logics over the Reals.
ECEASST, 2013

Deciding the Satisfiability of MITL Specifications.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Deterministic Counter Machines and Parallel Matching Computations.
Proceedings of the Implementation and Application of Automata, 2013

A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic.
Proceedings of the 2013 20th International Symposium on Temporal Representation and Reasoning, 2013

Deciding Continuous-Time Metric Temporal Logic with Counting Modalities.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

2012
From Regular to Strictly Locally Testable Languages.
Int. J. Found. Comput. Sci., 2012

Constraint LTL Satisfiability Checking without Automata
CoRR, 2012

Strict Local Testability with Consensus Equals Regularity.
Proceedings of the Implementation and Application of Automata, 2012

The Tale of SOLOIST: A Specification Language for Service Compositions Interactions.
Proceedings of the Formal Aspects of Component Software, 9th International Symposium, 2012

2011
Consensual languages and matching finite-state computations.
RAIRO - Theor. Inf. and Applic., 2011

From Regular to Strictly Locally Testable Languages
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Completeness of the Bounded Satisfiability Problem for Constraint LTL.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

2010
Bounded Reachability for Temporal Logic over Constraint Systems
CoRR, 2010

Bounded Reachability for Temporal Logic over Constraint Systems.
Proceedings of the TIME 2010, 2010

2009
Dense-choice Counter Machines revisited
Proceedings of the Proceedings International Workshop on Verification of Infinite-State Systems, 2009

A Metric Encoding for Bounded Model Checking (extended version)
CoRR, 2009

Languages defined by consensual computations.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

A Metric Encoding for Bounded Model Checking.
Proceedings of the FM 2009: Formal Methods, 2009

2008
Consensual Definition of Languages by Regular Sets.
Proceedings of the Language and Automata Theory and Applications, 2008

Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking.
Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE 2008), 2008

Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time.
Proceedings of the Theoretical Aspects of Computing, 2008

Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops.
Proceedings of the Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30, 2008

Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2008

2007
Regular Languages and Associative Language Descriptions.
Discrete Mathematics & Theoretical Computer Science, 2007

The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties.
Proceedings of the 6th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2007

Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework.
Proceedings of the 6th International Symposium on Parallel and Distributed Computing (ISPDC 2007), 2007

Trio2Promela: A Model Checker for Temporal Metric Specifications.
Proceedings of the 29th International Conference on Software Engineering (ICSE 2007), 2007

Model Checking Temporal Metric Specifications with Trio2Promela.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

2006
Picture languages: Tiling systems versus tile rewriting grammars.
Theor. Comput. Sci., 2006

2005
A scalable formal method for design and automatic checking of user interfaces.
ACM Trans. Softw. Eng. Methodol., 2005

2004
Experiences with a Formal Method for Design and Automatic Checking of User Interfaces.
Proceedings of the MBUI 2004, 2004

Model checking-aided design of secure distributed systems.
Proceedings of the IASTED International Conference on Software Engineering, 2004

Real-Counter Automata and Their Decision Problems.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
Verification in loosely synchronous queue-connected discrete timed automata.
Theor. Comput. Sci., 2003

Presburger liveness verification of discrete timed automata.
Theor. Comput. Sci., 2003

Model-Checking TRIO Specifications in SPIN.
Proceedings of the FME 2003: Formal Methods, 2003

Automatic Verification of Multi-queue Discrete Timed Automata.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Dense Counter Machines and Verification Problems.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
Associative language descriptions.
Theor. Comput. Sci., 2002

2001
On Presburger Liveness of Discrete Timed Automata.
Proceedings of the STACS 2001, 2001

Some Structural Properties of Associative Language Descriptions.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

A Scalable Formal Method for Design and Automatic Checking of User Interfaces.
Proceedings of the 23rd International Conference on Software Engineering, 2001

Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Alias Analysis by Means of a Model Checker.
Proceedings of the Compiler Construction, 10th International Conference, 2001

2000
Generation of Execution Sequences for Modular Time Critical Systems.
IEEE Trans. Software Eng., 2000

Tree Adjoining Languages and Multipushdown Languages.
Theory Comput. Syst., 2000

Associative definition of programming languages.
Comput. Lang., 2000

A Case Study on Applying a Tool for Automated System Analysis Based on Modular Specifications Written in TRIO.
Autom. Softw. Eng., 2000

1998
A Tool for Automated System Analysis based on Modular Specifications.
Proceedings of the Thirteenth IEEE Conference on Automated Software Engineering, 1998

A Finite-Domain Semantics for Testing Temporal Logic Specifications.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1998

1996
A Polynomial-Time Parsing Algorithm for K-Depth Languages.
J. Comput. Syst. Sci., 1996

Generating Functional Test Cases in-the-large for Time-critical Systems from Logic-based Specifications.
Proceedings of the 1996 International Symposium on Software Testing and Analysis, 1996

1994
Object-Oriented Logical Specification of Time-Critical Systems.
ACM Trans. Softw. Eng. Methodol., 1994

1993
Embedding Time Granularity in a Logical Specification Language for Synchronous Real-Time Systems.
Sci. Comput. Program., 1993

Reuse of Object-Oriented Requirements Specifications.
Proceedings of the Entity-Relationship Approach, 1993

1992
Finite Time Semantics for Executable Logic Specifications.
Proceedings of the Real Time Computing, 1992

Testing by Executing Logic Specifications.
Proceedings of the Real Time Computing, 1992

1991
An Object-Oriented Logic Language for Modular System Specification.
Proceedings of the ECOOP'91 European Conference on Object-Oriented Programming, 1991


  Loading...