Benedetto Intrigila

Theor. Comput. Sci., 2012

2011

Solution to the Range Problem for Combinatory Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Cost-optimal Strong Planning in Non-deterministic Domains.

[BibT_eX]

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

[BibT_eX]

[DOI]

CoRR, 2010

Planning for Autonomous Planetary Vehicles.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Autonomic and Autonomous Systems, 2010

A PDDL+ Benchmark Problem: The Batch Chemical Plant.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On some counting problems for semi-linear sets

[BibT_eX]

[DOI]

CoRR, 2009

The Omega Rule is Π11-Complete in the λβ-Calculus

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

Evaluating Fuzzy Controller Robustness Using Model Checking.

[BibT_eX]

[DOI]

Daniele Magazzeni

Proceedings of the Fuzzy Logic and Applications, 8th International Workshop, 2009

UPMurphi: A Tool for Universal Planning on PDDL+ Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Int. J. Softw. Eng. Knowl. Eng., 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Verifying Extended Criteria for the Interoperability of Security Devices.

[BibT_eX]

[DOI]

Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008, 2008

OBDD Compression of Numerical Controllers.

[BibT_eX]

Proceedings of the ICINCO 2008, 2008

2007

Computational models of myocardial endomysial collagen arrangement.

[BibT_eX]

[DOI]

Comput. Methods Programs Biomed., 2007

The Omega Rule is P11-Complete in the lambdabeta -Calculus.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Finite horizon analysis of Markov Chains with the Murphi verifier.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2006

Solution of a Problem of Barendregt on Sensible lambda-Theories.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

An XML environment for scenario based requirements engineering.

[BibT_eX]

[DOI]

J. Syst. Softw., 2006

Interoperability mapping from XML schemas to ER diagrams.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2006

Automatic generation of optimal controllers through model checking techniques.

[BibT_eX]

Proceedings of the ICINCO 2006, 2006

A Case Study on Automated Generation of Integration Tests.

[BibT_eX]

[DOI]

Proceedings of the Forum on specification and Design Languages, 2006

2005

Some results on extensionality in lambda calculus.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

A Model Checking Technique for the Verification of Fuzzy Control Systems.

[BibT_eX]

[DOI]

Proceedings of the 2005 International Conference on Computational Intelligence for Modelling Control and Automation (CIMCA 2005), 2005

Exploiting Hub States in Automatic Verification.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2005

2004

An environment for the design and implementation of visual applications.

[BibT_eX]

[DOI]

Sergio Orefice

J. Vis. Lang. Comput., 2004

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

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2004

A Methodology for Scenario Development.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Bounded Probabilistic Model Checking with the Muralpha Verifier.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

2003

On structural properties of eta-expansions of identity.

[BibT_eX]

[DOI]

Monica Nesi

Inf. Process. Lett., 2003

An XML Definition Language to Support Scenario-Based Requirements Engineering.

[BibT_eX]

[DOI]

Int. J. Softw. Eng. Knowl. Eng., 2003

Finite Horizon Analysis of Stochastic Systems with the Mur varphi Verifier.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Automatic Verification of a Turbogas Control System with the Mur varphi Verifier.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 2003

Xere: Towards a Natural Interoperability between XML and ER Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Fundamental Approaches to Software Engineering, 2003

Finite Horizon Analysis of Markov Chains with the Mur-phi Verifier.

[BibT_eX]

[DOI]

Proceedings of the Correct Hardware Design and Verification Methods, 2003

Integrating RAM and Disk Based Verification within the Mur-phi Verifier.

[BibT_eX]

[DOI]

Proceedings of the Correct Hardware Design and Verification Methods, 2003

2002

Exploiting Transition Locality in the Disk Based Mur phi Verifier.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

2001

Generating graphical applications from state-transition visual specifications.

[BibT_eX]

[DOI]

Sergio Orefice

Int. J. Hum. Comput. Stud., 2001

A Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser.

[BibT_eX]

[DOI]

Ivano Salvo

Stefano Sorgi

Inf. Comput., 2001

Synchronized Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Exploiting Transition Locality in Automatic Verification.

[BibT_eX]

[DOI]

Proceedings of the Correct Hardware Design and Verification Methods, 2001

A Probabilistic Approach to Automatic Verification of Concurrent Systems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

E. Biasone

Math. Struct. Comput. Sci., 2000

Two Problems on Reduction Graphs in Lambda Calculus.

[BibT_eX]

[DOI]

Anna Rita Laurenzi

Fundam. Informaticae, 2000

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

[BibT_eX]

[DOI]

Acta Informatica, 2000

1999

Orders, Reduction Graphs and Spectra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

A Comprehensive Setting for Matching and Unification over Iterative Terms.

[BibT_eX]

[DOI]

Paola Inverardi

Fundam. Informaticae, 1999

1997

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

[BibT_eX]

[DOI]

Inf. Comput., 1997

1996

A Remark on Infinite Matching vs Infinite Unification.

[BibT_eX]

[DOI]

J. Symb. Comput., 1996

1994

The Ant-Lion Paradigm for Strong Normalization

[BibT_eX]

[DOI]

Corrado Böhm

Inf. Comput., October, 1994

Some Results on Numerical Systems in lambda-Calculus.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1994

1993

Some New Results on Easy lambda-Terms.

[BibT_eX]

[DOI]

Alessandro Berarducci

Theor. Comput. Sci., 1993

The Basic Decision Problem in lambda-Calculus.

[BibT_eX]

[DOI]

Math. Log. Q., 1993

1991

A problem on easy terms in Calculus.

[BibT_eX]

Fundam. Informaticae, 1991

Combinatorial Principles in Elementary Number Theory.

[BibT_eX]

[DOI]

Alessandro Berarducci

Ann. Pure Appl. Log., 1991

1988

Negative Results on the Reduction of the Recursion Scheme.

[BibT_eX]

[DOI]

Math. Log. Q., 1988

1983

Baire Category on Cardinals.

[BibT_eX]

[DOI]

C. Alkor