Benedetto Intrigila

According to our database1, Benedetto Intrigila
  • authored at least 73 papers between 1983 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Lambda theories allowing terms with a finite number of fixed points.
Mathematical Structures in Computer Science, 2017

Refutation of Sallé's Longstanding Conjecture.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016
A BPMN-Based Automated Approach for the Analysis of Healthcare Processes.
Proceedings of the 25th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2016

2015
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case.
Theor. Comput. Sci., 2015

On the commutative equivalence of semi-linear sets of Nk.
Theor. Comput. Sci., 2015

On the commutative equivalence of bounded context-free and regular languages: The code case.
Theor. Comput. Sci., 2015

Synthesis of Cost-Optimal Strong Plans in Non-Deterministic Domains.
International Journal on Artificial Intelligence Tools, 2015

2013
Sybel: a System Modelling Language Enhancing Automatic Support in the Software Development Process.
International Journal of Software Engineering and Knowledge Engineering, 2013

CGMurphi: Automatic synthesis of numerical controllers for nonlinear hybrid systems.
Eur. J. Control, 2013

A Lightweight Formalism for the Integration of BPMN Models with Domain Ontologies.
Proceedings of the Workshop AI Meets Business Processes 2013 co-located with the 13th Conference of the Italian Association for Artificial Intelligence (AI*IA 2013), 2013

2012
Quasi-polynomials, linear Diophantine equations and semi-linear sets.
Theor. Comput. Sci., 2012

2011
Solution to the Range Problem for Combinatory Logic.
Fundam. Inform., 2011

Cost-optimal Strong Planning in Non-deterministic Domains.
Proceedings of the ICINCO 2011 - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics, Volume 1, Noordwijkerhout, The Netherlands, 28, 2011

2010
Resource-Optimal Planning For An Autonomous Planetary Vehicle
CoRR, 2010

Planning for Autonomous Planetary Vehicles.
Proceedings of the Sixth International Conference on Autonomic and Autonomous Systems, 2010

A PDDL+ Benchmark Problem: The Batch Chemical Plant.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
The Parikh counting functions of sparse context-free languages are quasi-polynomials.
Theor. Comput. Sci., 2009

On some counting problems for semi-linear sets
CoRR, 2009

The Omega Rule is Π11-Complete in the λβ-Calculus
Logical Methods in Computer Science, 2009

Evaluating Fuzzy Controller Robustness Using Model Checking.
Proceedings of the Fuzzy Logic and Applications, 8th International Workshop, 2009

UPMurphi: A Tool for Universal Planning on PDDL+ Problems.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
An XML Based Methodology to Model and Use Scenarios in the Software Development Process.
International Journal of Software Engineering and Knowledge Engineering, 2008

The Parikh functions of sparse context-free languages are quasi-polynomials
CoRR, 2008

Verifying Extended Criteria for the Interoperability of Security Devices.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008, 2008

OBDD Compression of Numerical Controllers.
Proceedings of the ICINCO 2008, 2008

2007
Computational models of myocardial endomysial collagen arrangement.
Computer Methods and Programs in Biomedicine, 2007

The Omega Rule is P11-Complete in the lambdabeta -Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

A Genetic Approach to the Automatic Generation of Fuzzy Control Systems from Numerical Controllers.
Proceedings of the AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 2007

2006
On the structure of the counting function of sparse context-free languages.
Theor. Comput. Sci., 2006

Finite horizon analysis of Markov Chains with the Murphi verifier.
STTT, 2006

Solution of a Problem of Barendregt on Sensible lambda-Theories.
Logical Methods in Computer Science, 2006

An XML environment for scenario based requirements engineering.
Journal of Systems and Software, 2006

Interoperability mapping from XML schemas to ER diagrams.
Data Knowl. Eng., 2006

Solution of a Problem of Barendregt on Sensible lambda-Theories
CoRR, 2006

Automatic generation of optimal controllers through model checking techniques.
Proceedings of the ICINCO 2006, 2006

A Case Study on Automated Generation of Integration Tests.
Proceedings of the Forum on specification and Design Languages, 2006

2005
Some results on extensionality in lambda calculus.
Ann. Pure Appl. Logic, 2005

A Model Checking Technique for the Verification of Fuzzy Control Systems.
Proceedings of the 2005 International Conference on Computational Intelligence for Modelling Control and Automation (CIMCA 2005), 2005

Exploiting Hub States in Automatic Verification.
Proceedings of the Automated Technology for Verification and Analysis, 2005

2004
An environment for the design and implementation of visual applications.
J. Vis. Lang. Comput., 2004

Exploiting transition locality in automatic verification of finite-state concurrent systems.
STTT, 2004

A Methodology for Scenario Development.
Proceedings of the Sixteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2004), 2004

The Omega Rule is II_2^0-Hard in the lambda beta -Calculus.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Bounded Probabilistic Model Checking with the Muralpha Verifier.
Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

2003
On structural properties of eta-expansions of identity.
Inf. Process. Lett., 2003

An XML Definition Language to Support Scenario-Based Requirements Engineering.
International Journal of Software Engineering and Knowledge Engineering, 2003

Synchronized regular expressions.
Acta Inf., 2003

Finite Horizon Analysis of Stochastic Systems with the Mur varphi Verifier.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Automatic Verification of a Turbogas Control System with the Mur varphi Verifier.
Proceedings of the Hybrid Systems: Computation and Control, 2003

Xere: Towards a Natural Interoperability between XML and ER Diagrams.
Proceedings of the Fundamental Approaches to Software Engineering, 2003

Finite Horizon Analysis of Markov Chains with the Mur-phi Verifier.
Proceedings of the Correct Hardware Design and Verification Methods, 2003

Integrating RAM and Disk Based Verification within the Mur-phi Verifier.
Proceedings of the Correct Hardware Design and Verification Methods, 2003

2002
Exploiting Transition Locality in the Disk Based Mur phi Verifier.
Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

2001
Generating graphical applications from state-transition visual specifications.
Int. J. Hum.-Comput. Stud., 2001

A Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser.
Inf. Comput., 2001

Synchronized Regular Expressions.
Electr. Notes Theor. Comput. Sci., 2001

Exploiting Transition Locality in Automatic Verification.
Proceedings of the Correct Hardware Design and Verification Methods, 2001

A Probabilistic Approach to Automatic Verification of Concurrent Systems.
Proceedings of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001), 2001

2000
On the number of fixed points of a combinator in lambda calculus.
Mathematical Structures in Computer Science, 2000

Two Problems on Reduction Graphs in Lambda Calculus.
Fundam. Inform., 2000

On the Generalization of Higman and Kruskal's Theorems to Regular Languages and Rational Trees.
Acta Inf., 2000

1999
Orders, Reduction Graphs and Spectra.
Theor. Comput. Sci., 1999

A Comprehensive Setting for Matching and Unification over Iterative Terms.
Fundam. Inform., 1999

1997
Non-existent Statman's Double Fixedpoint Combinator Does Not Exist, Indeed.
Inf. Comput., 1997

1996
A Remark on Infinite Matching vs Infinite Unification.
J. Symb. Comput., 1996

1994
The Ant-Lion Paradigm for Strong Normalization
Inf. Comput., October, 1994

Some Results on Numerical Systems in lambda-Calculus.
Notre Dame Journal of Formal Logic, 1994

1993
Some New Results on Easy lambda-Terms.
Theor. Comput. Sci., 1993

The Basic Decision Problem in lambda-Calculus.
Math. Log. Q., 1993

1991
A problem on easy terms in Calculus.
Fundam. Inform., 1991

Combinatorial Principles in Elementary Number Theory.
Ann. Pure Appl. Logic, 1991

1988
Negative Results on the Reduction of the Recursion Scheme.
Math. Log. Q., 1988

1983
Baire Category on Cardinals.
Math. Log. Q., 1983


  Loading...