Stefano Crespi-Reghizzi

According to our database1, Stefano Crespi-Reghizzi authored at least 101 papers between 1970 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Fast deterministic parsers for transition networks.
Acta Inf., 2018

Deque Languages, Automata and Planar Graphs.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

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

Toward a theory of input-driven locally parsable languages.
Theor. Comput. Sci., 2017

Higher-order Operator Precedence Languages.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

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

2015
Parallel parsing made practical.
Sci. Comput. Program., 2015

BSP: A Parsing Tool for Ambiguous Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2015

From Ambiguous Regular Expressions to Deterministic Parsing Automata.
Proceedings of the Implementation and Application of Automata, 2015

Locally Chain-Parsable Languages.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

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

Shift-Reduce Parsers for Transition Networks.
Proceedings of the Language and Automata Theory and Applications, 2014

Complexity of Extended vs. Classic LR Parsers.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

The PAPAGENO Parallel-Parser Generator.
Proceedings of the Compiler Construction - 23rd International Conference, 2014

2013
Formal Languages and Compilation, Second Edition.
Texts in Computer Science, Springer, ISBN: 978-1-4471-5514-0, 2013

Continuous learning of compiler heuristics.
TACO, 2013

Parallel parsing of operator precedence grammars.
Inf. Process. Lett., 2013

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

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

2012
Operator precedence and the visibly pushdown property.
J. Comput. Syst. Sci., 2012

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

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

PAPAGENO: A Parallel Parser Generator for Operator Precedence Grammars.
Proceedings of the Software Language Engineering, 5th International Conference, 2012

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

A unifying approach to picture grammars.
Inf. Comput., 2011

From Regular to Strictly Locally Testable Languages
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.
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.
Softw., Pract. Exper., 2010

Efficient recognition of trace languages defined by repeat-until loops.
Inf. Comput., 2010

Operator Precedence and the Visibly Pushdown Property.
Proceedings of the Language and Automata Theory and Applications, 2010



An empirical investigation into a large-scale Java open source code repository.
Proceedings of the International Symposium on Empirical Software Engineering and Measurement, 2010

Parallelism and Retargetability in the ILDJIT Dynamic Compiler.
Proceedings of the ARCS '10, 2010

2009
Formal Languages and Compilation.
Texts in Computer Science, Springer, ISBN: 978-1-84882-050-0, 2009

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

Just-In-Time compilation on ARM processors.
Proceedings of the 4th workshop on the Implementation, 2009

Traces of Control-Flow Graphs.
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.
Proceedings of the Compiler Construction, 18th International Conference, 2009

2008
A parallel dynamic compiler for CIL bytecode.
SIGPLAN Notices, 2008

A SAT-based parser and completer for pictures specified by tiling.
Pattern Recognition, 2008

A CKY parser for picture grammars.
Inf. Process. Lett., 2008

Regional Languages and Tiling: A Unifying Approach to Picture Grammars.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

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

2007
Hierarchical Cluster Assignment for Coarse-Grain Reconfigurable Coprocessors.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

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

Selective compilation via fast code analysis and bytecode tracing.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

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

Tile rewriting grammars and picture languages.
Theor. Comput. Sci., 2005

JIST: Just-In-Time scheduling translation for parallel processors.
Scientific Programming, 2005

2004
JIST: Just-in-Time Scheduling Translation for Parallel Processors.
Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

2003
Tile Rewriting Grammars.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Towards a Brain Compatible Theory of Syntax Based on Local Testability.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

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

The Impact of Alias Analysis on VLIW Scheduling.
Proceedings of the High Performance Computing, 4th International Symposium, 2002

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

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

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

1999
Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
Grammar Partitioning and Modular Deterministic Parsing.
Comput. Lang., 1998

1997
Supporting Highly Available Distributed Services Using Linda Paradigm.
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.
Proceedings of the 23rd EUROMICRO Conference '97, 1997

1996
Multi-Push-Down Languages and Grammars.
Int. J. Found. Comput. Sci., 1996

1995
Deterministic Parsing for Augmented Context-free Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993
The LOGRES prototype.
Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993

Fair First Languages and Parallel Programme Schemes.
Proceedings of the Developments in Language Theory, 1993

1992
Designing and Prototyping Data-Intensive Applications in the Logres and Algres Programming Environment.
IEEE Trans. Software Eng., 1992

Behavioral Inheritance: Concepts, Ada Implementation and Experience.
TRI-Ada, 1992

Real-Time Scheduling by Queue Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

1991
QRT FIFO Automata, Breath-First Grammars and Their Relations.
Theor. Comput. Sci., 1991

Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Definition of Reusable Concurrent Software Components.
Proceedings of the ECOOP'91 European Conference on Object-Oriented Programming, 1991

1990
Algres: An Advanced System for Complex Applications.
IEEE Software, 1990

Breath and Depth Grammars and Deque Automata.
Int. J. Found. Comput. Sci., 1990

Integrating Object-Oriented Data Modeling with a Rule-Based Programming Paradigm.
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.
Proceedings of the First Nordic Conference on Advanced Systems Engineering, 1989

1988
Software Prototyping by Relational Techniques: Experiences with Program Construction Systems.
IEEE Trans. Software Eng., 1988

Breadth-First Phrase Structure Grammars and Queue Automata.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

The Algres Project.
Proceedings of the Advances in Database Technology, 1988

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

1986
On Deterministic Multi-Pass Analysis.
SIAM J. Comput., 1986

Automation in Software Development (Panel).
IFIP Congress, 1986

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

1983
Relational data bases in the design of program construction systems.
SIGPLAN Notices, 1983

1982
MML: A programming line for multiple-microprocessors systems.
Proceedings of the Proceedings of the 3rd International Conference on Distributed Computing Systems, 1982

1981
Threshold Nets and Cell-Assemblies
Information and Control, June, 1981

Operator Precedence Grammars and the Noncounting Property.
SIAM J. Comput., 1981

1980
Compiler Testing using a Sentence Generator.
Softw., Pract. Exper., 1980

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

1978
Algebraic Properties of Operator Precedence Languages
Information and Control, May, 1978

Noncounting Context-Free Languages.
J. ACM, 1978

A Class of Grammar Generating Non-Counting Languages.
Inf. Process. Lett., 1978

1977
Petri Nets and Szilard Languages
Information and Control, February, 1977

1975
Erratum: A Decidability Theorem for a Class of Vector-Addition Systems.
Inf. Process. Lett., 1975

A Decidability Theorem for a Class of Vector-Addition Systems.
Inf. Process. Lett., 1975

1973
The Use of Grammatical Inference for Designing Programming Languages.
Commun. ACM, 1973

1972
Approximation of Phrase Markers by Regular Sets.
ICALP, 1972

1971
Reduction of Enumeration in Grammar Acquisition.
Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, 1971

An Effective Model for Grammar Interference.
IFIP Congress (1), 1971

1970
A language for treating graphs.
Commun. ACM, 1970


  Loading...