Stefano Crespi-Reghizzi

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

General parsing with regular expression matching.

[BibT_eX]

[DOI]

J. Comput. Lang., January, 2023

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

Two-dimensional Dyck words.

[BibT_eX]

[DOI]

CoRR, 2023

Two-Dimensional Dyck Words (short paper) (text not included).

[BibT_eX]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022

Reducing the local alphabet size in tiling systems by means of 2D comma-free codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Fast GLR parsers for extended BNF grammars and transition networks.

[BibT_eX]

[DOI]

J. Comput. Lang., 2021

A deterministic parsing algorithm for ambiguous regular expressions.

[BibT_eX]

[DOI]

Acta Informatica, 2021

Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2021

Reducing the Local Alphabet Size in Tiling Systems for Picture Languages.

[BibT_eX]

[DOI]

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Reducing Local Alphabet Size in Recognizable Picture Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

Two-dimensional models.

[BibT_eX]

[DOI]

Dora Giammarresi

Violetta Lonati

Proceedings of the Handbook of Automata Theory., 2021

2020

Deque automata, languages, and planar graph representations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Beyond operator-precedence grammars and languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Aperiodicity, Star-freeness, and First-order Definability of Structured Context-Free Languages.

[BibT_eX]

[DOI]

CoRR, 2020

A Generalized LR(1) Parser or Extended Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Star-Freeness, First-Order Definability and Aperiodicity of Structured Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

2019

Formal Languages and Compilation, Third Edition

[BibT_eX]

[DOI]

Texts in Computer Science, Springer, ISBN: 978-3-030-04878-5, 2019

Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet.

[BibT_eX]

[DOI]

Inf. Comput., 2019

A Benchmark Production Tool for Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2019

Deque Languages, Automata and Planar Graphs (text not included).

[BibT_eX]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Regular Languages as Local Functions with Small Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

Non-erasing Chomsky-Sch{ü}tzenberger theorem with grammar-independent alphabet.

[BibT_eX]

[DOI]

CoRR, 2018

Fast deterministic parsers for transition networks.

[BibT_eX]

[DOI]

Acta Informatica, 2018

Deque Languages, Automata and Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Counter machines, Petri Nets, and consensual computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Toward a theory of input-driven locally parsable languages.

[BibT_eX]

[DOI]

Violetta Lonati

Theor. Comput. Sci., 2017

Higher-order Operator Precedence Languages.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

2016

The Missing Case in Chomsky-Schützenberger Theorem.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Parallel parsing made practical.

[BibT_eX]

[DOI]

Federica Panella

Sci. Comput. Program., 2015

BSP: A Parsing Tool for Ambiguous Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2015

From Ambiguous Regular Expressions to Deterministic Parsing Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2015

Locally Chain-Parsable Languages.

[BibT_eX]

[DOI]

Violetta Lonati

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Commutative Languages and their Composition by Consensual Methods.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Shift-Reduce Parsers for Transition Networks.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

Complexity of Extended vs. Classic LR Parsers.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

The PAPAGENO Parallel-Parser Generator.

[BibT_eX]

[DOI]

Federica Panella

Proceedings of the Compiler Construction - 23rd International Conference, 2014

2013

Formal Languages and Compilation, Second Edition.

[BibT_eX]

[DOI]

Texts in Computer Science, Springer, ISBN: 978-1-4471-5514-0, 2013

Continuous learning of compiler heuristics.

[BibT_eX]

[DOI]

Michele Tartara

ACM Trans. Archit. Code Optim., 2013

Parallel parsing of operator precedence grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Strict Local Testability with Consensus Equals Regularity, and Other Properties.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Parsing methods streamlined.

[BibT_eX]

[DOI]

CoRR, 2013

Deterministic Counter Machines and Parallel Matching Computations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2013

2012

Operator precedence and the visibly pushdown property.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Strict Local Testability with Consensus Equals Regularity.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

PAPAGENO: A Parallel Parser Generator for Operator Precedence Grammars.

[BibT_eX]

[DOI]

Ermes Viviani

Proceedings of the Software Language Engineering, 5th International Conference, 2012

Parallel paradigms and run-time management techniques for many-core architectures: the 2PARMA approach.

[BibT_eX]

[DOI]

Proceedings of the 2012 Interconnection Network Architecture, 2012

2011

Consensual languages and matching finite-state computations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

A unifying approach to picture grammars.

[BibT_eX]

[DOI]

Inf. Comput., 2011

From Regular to Strictly Locally Testable Languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Invited paper: Parallel programming and run-time resource management framework for many-core platforms: The 2PARMA approach.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip, 2011

2010

A highly flexible, parallel virtual machine: design and experience of ILDJIT.

[BibT_eX]

[DOI]

Andrea Di Biagio

Softw. Pract. Exp., 2010

Efficient recognition of trace languages defined by repeat-until loops.

[BibT_eX]

[DOI]

Massimiliano Goldwurm

Inf. Comput., 2010

2PARMA: Parallel Paradigms and Run-Time Management Techniques for Many-Core Architectures.

[BibT_eX]

[DOI]

Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2010

2PARMA: Parallel Paradigms and Run-time Management Techniques for Many-Core Architectures.

[BibT_eX]

[DOI]

Proceedings of the VLSI 2010 Annual Symposium - Selected papers, 2010

An empirical investigation into a large-scale Java open source code repository.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Empirical Software Engineering and Measurement, 2010

Parallelism and Retargetability in the ILDJIT Dynamic Compiler.

[BibT_eX]

[DOI]

Michele Tartara

Proceedings of the ARCS '10, 2010

2009

Formal Languages and Compilation.

[BibT_eX]

[DOI]

Texts in Computer Science, Springer, ISBN: 978-1-84882-050-0, 2009

Algebraic properties of structured context-free languages: old approaches and novel developments

[BibT_eX]

[DOI]

CoRR, 2009

Languages defined by consensual computations.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Just-In-Time compilation on ARM processors.

[BibT_eX]

[DOI]

Michele Tartara

Proceedings of the 4th workshop on the Implementation, 2009

Traces of Control-Flow Graphs.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Dynamic Look Ahead Compilation: A Technique to Hide JIT Compilation Latencies in Multicore Environment.

[BibT_eX]

[DOI]

Proceedings of the Compiler Construction, 18th International Conference, 2009

2008

A parallel dynamic compiler for CIL bytecode.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 2008

A SAT-based parser and completer for pictures specified by tiling.

[BibT_eX]

[DOI]

Pattern Recognit., 2008

A CKY parser for picture grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Formal semantics of language and the Richard-Berry paradox

[BibT_eX]

[DOI]

CoRR, 2008

Regional Languages and Tiling: A Unifying Approach to Picture Grammars.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Consensual Definition of Languages by Regular Sets.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Hierarchical Cluster Assignment for Coarse-Grain Reconfigurable Coprocessors.

[BibT_eX]

[DOI]

Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

2006

Picture languages: Tiling systems versus tile rewriting grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Selective compilation via fast code analysis and bytecode tracing.

[BibT_eX]

[DOI]

Pasquale Palumbo

Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Jelatine: a virtual machine for small embedded systems.

[BibT_eX]

[DOI]

Gabriele Svelto

Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems, 2006

Global instruction scheduling in dynamic compilation for embedded systems.

[BibT_eX]

[DOI]

Dario Domizioli

Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems, 2006

2005

A scalable formal method for design and automatic checking of user interfaces.

[BibT_eX]

[DOI]

Jean Berstel

Gilles Roussel

ACM Trans. Softw. Eng. Methodol., 2005

Tile rewriting grammars and picture languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

JIST: Just-In-Time scheduling translation for parallel processors.

[BibT_eX]

[DOI]

Gerlando Falauto

Sci. Program., 2005

2003

Tile Rewriting Grammars.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Towards a Brain Compatible Theory of Syntax Based on Local Testability.

[BibT_eX]

Valentino Braitenberg

Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002

Associative language descriptions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The Impact of Alias Analysis on VLIW Scheduling.

[BibT_eX]

[DOI]

Marco Garatti

Roberto Costa

Erven Rohou

Proceedings of the High Performance Computing, 4th International Symposium, 2002

2001

Some Structural Properties of Associative Language Descriptions.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Partitioning of Hierarchical Automation Systems.

[BibT_eX]

[DOI]

Emanuele Ciapessoni

Francesco Maestri

Judit Szanto

Andrea C. Ornstein

Giuseppe Psaila

Proceedings of the 13th Euromicro Conference on Real-Time Systems (ECRTS 2001), 2001

2000

Associative definition of programming languages.

[BibT_eX]

[DOI]

Comput. Lang., 2000

1999

Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Grammar Partitioning and Modular Deterministic Parsing.

[BibT_eX]

[DOI]

Giuseppe Psaila

Comput. Lang., 1998

1997

Supporting Highly Available Distributed Services Using Linda Paradigm.

[BibT_eX]

Pietro Manzoni

Alberto Tonello

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

The Evolution of MML/MME towards Real Time and Heterogeneous Systems.

[BibT_eX]

[DOI]

Francesco Calzolari

Luca Cicognani

Giorgio Bossi

Proceedings of the 23rd EUROMICRO Conference '97, 1997

1996

Multi-Push-Down Languages and Grammars.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1996

1995

Deterministic Parsing for Augmented Context-free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993

The LOGRES prototype.

[BibT_eX]

[DOI]

Piero Fraternali

Stefano Paraboschi

Letizia Tanca

Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993

Fair First Languages and Parallel Programme Schemes.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

Designing and Prototyping Data-Intensive Applications in the Logres and Algres Programming Environment.

[BibT_eX]

[DOI]

Letizia Tanca

IEEE Trans. Software Eng., 1992

Behavioral Inheritance: Concepts, Ada Implementation and Experience.

[BibT_eX]

[DOI]

Marco De Michele

Stefano Perotta

Proceedings of the Conference Proceedings on TRI-Ada 1992, 1992

Real-Time Scheduling by Queue Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

Formal Definition of Nested Relations by Syntactical Mappings.

[BibT_eX]

[DOI]

Proceedings of the Specifications of Database Systems, 1992

1991

QRT FIFO Automata, Breath-First Grammars and Their Relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Definition of Reusable Concurrent Software Components.

[BibT_eX]

[DOI]

Guido Galli de Paratesi

Stefano Genolini

Proceedings of the ECOOP'91 European Conference on Object-Oriented Programming, 1991

1990

Algres: An Advanced System for Complex Applications.

[BibT_eX]

[DOI]

Roberto V. Zicari

Gianfranco Lamperti

Luigi Lavazza

IEEE Softw., 1990

Breath and Depth Grammars and Deque Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

Integrating Object-Oriented Data Modeling with a Rule-Based Programming Paradigm.

[BibT_eX]

[DOI]

Letizia Tanca

Roberto V. Zicari

Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990

1989

ALGRES: An Extended Relational Database System for the Specification and Prototyping of Complex Applications.

[BibT_eX]

[DOI]

Proceedings of the First Nordic Conference on Advanced Systems Engineering, 1989

1988

Software Prototyping by Relational Techniques: Experiences with Program Construction Systems.

[BibT_eX]

[DOI]

Andrea Di Maio

Luigi Lavazza

IEEE Trans. Software Eng., 1988

Breadth-First Phrase Structure Grammars and Queue Automata.

[BibT_eX]

[DOI]

E. Allevi

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

The Algres Project.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 1988

1987

Distributable Ada programs.

[BibT_eX]

[DOI]

Andrea Di Maio

Francesco Maderna

Proceedings of the First International Workshop on Real-Time Ada Issues, 1987

Algebraic ADT Specifications of an Extended Relational Algebra and their Conversion into a Working Prototype.

[BibT_eX]

[DOI]

Luigi Lavazza

Proceedings of the Algebraic Methods: Theory, 1987

1986

On Deterministic Multi-Pass Analysis.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Automation in Software Development (Panel).

[BibT_eX]

Proceedings of the Information Processing 86, 1986

1985

Execution monitoring and debugging tool for Ada using relational algebra.

[BibT_eX]

[DOI]

Andrea Di Maio

Proceedings of the 1985 Annual ACM SIGAda International Conference on Ada, 1985

1984

Multiple-Microprocessor Programming Techniques: MML, a New Set of Tools.

[BibT_eX]

[DOI]

Maurelio Boari

Alberto Dasprá

Francesco Maderna

Antonio Natali

Computer, 1984

1983

Relational data bases in the design of program construction systems.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1983

1982

MML: A programming line for multiple-microprocessors systems.

[BibT_eX]

Maurelio Boari

Alberto Dasprá

Antonio Natali

Proceedings of the Proceedings of the 3rd International Conference on Distributed Computing Systems, 1982

1981

Threshold Nets and Cell-Assemblies

[BibT_eX]

[DOI]

A. Pistorello

C. Romoli

Inf. Control., June, 1981

Operator Precedence Grammars and the Noncounting Property.

[BibT_eX]

[DOI]

Giovanni Guida

SIAM J. Comput., 1981

1980

Compiler Testing using a Sentence Generator.

[BibT_eX]

[DOI]

Augusto Celentano

Pierluigi Della Vigna

Carlo Ghezzi

G. Granata

Florencia Savoretti

Softw. Pract. Exp., 1980

PLZ-SYS PL/65 PL/M RPL/2 Mistral PLZ Special Feature A Survey of Microprocessor Languages.

[BibT_eX]

[DOI]

Pierluigi Corti

Alberto Dapra

Computer, 1980

1978

Algebraic Properties of Operator Precedence Languages

[BibT_eX]

[DOI]

David F. Martin

Inf. Control., May, 1978

Noncounting Context-Free Languages.

[BibT_eX]

[DOI]

Giovanni Guida

J. ACM, 1978

A Class of Grammar Generating Non-Counting Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

1977

Petri Nets and Szilard Languages

[BibT_eX]

[DOI]

Inf. Control., February, 1977

1975

Erratum: A Decidability Theorem for a Class of Vector-Addition Systems.

[BibT_eX]

Inf. Process. Lett., 1975

A Decidability Theorem for a Class of Vector-Addition Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1975

1973

The Use of Grammatical Inference for Designing Programming Languages.

[BibT_eX]

[DOI]

Michel A. Melkanoff

Larry Lichten

Commun. ACM, 1973

1972

Approximation of Phrase Markers by Regular Sets.

[BibT_eX]

Proceedings of the Automata, 1972

1971

Reduction of Enumeration in Grammar Acquisition.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, 1971

An Effective Model for Grammar Interference.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

Grammatical inference for defining extensions.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Extensible Languages, 1971

1970

A language for treating graphs.

[BibT_eX]

[DOI]