BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Finland
1 × Hungary
1 × India
1 × Japan
1 × Poland
1 × South Korea
1 × Sweden
2 × Germany
2 × Spain
2 × The Netherlands
3 × France
3 × Italy
3 × Portugal
5 × USA
Collaborated with:
M.C.Meo G.Levi J.Mauro F.S.d.Boer S.Etalle G.Delzanno R.Amadini N.Busi G.Zavattaro E.Marchiori C.Palamidessi C.D.Giusto K.R.Apt R.Giacobazzi A.Brogi S.Zuppiroli P.Ciancarini P.Tacchella J.Sneyers M.D.Preda S.Giallorenzo I.Lanese A.Bossi M.Bugliesi
Talks about:
constraint (12) program (11) logic (9) semant (5) concurr (4) chr (4) portfolio (3) composit (3) process (3) correct (3)

Person: Maurizio Gabbrielli

DBLP DBLP: Gabbrielli:Maurizio

Facilitated 1 volumes:

ICLP 2005Ed

Contributed to:

SAC 20152015
ICLP 20142014
SAC 20142014
SLE 20142014
CSEE&T 20122012
ICLP 20102010
PPDP 20092009
ESOP 20082008
PPDP 20072007
ICALP 20052005
PPDP 20052005
ICALP 20042004
ICALP 20032003
ICLP 20032003
FoSSaCS 20022002
PPDP 20012001
PEPM 19971997
SAS 19961996
ICLP 19951995
ILPS 19951995
PEPM 19951995
ICLP 19941994
POPL 19941994
SAC 19941994
POPL 19931993
ALP 19921992
JICSLP 19921992
ICALP 19911991
ICLP 19911991
PLILP 19911991
ALP 19901990
TAPSOFT, Vol.1: CAAP 19911991

Wrote 32 papers:

SAC-2015-AmadiniGM #named
SUNNY-CP: a sequential CP portfolio solver (RA, MG, JM), pp. 1861–1867.
ICLP-J-2014-AmadiniGM #approach #constraints #lazy evaluation #named #theorem proving
SUNNY: a Lazy Portfolio Approach for Constraint Solving (RA, MG, JM), pp. 509–524.
SAC-2014-AmadiniGM #constraints #theorem proving
An enhanced features extractor for a portfolio of constraint solvers (RA, MG, JM), pp. 1357–1359.
SLE-2014-PredaGLMG #adaptation #distributed #framework #named
AIOCJ: A Choreographic Framework for Safe Adaptive Distributed Applications (MDP, SG, IL, JM, MG), pp. 161–170.
CSEET-2012-ZuppiroliCG #game studies #product line #re-engineering
A Role-Playing Game for a Software Engineering Lab: Developing a Product Line (SZ, PC, MG), pp. 13–22.
ICLP-J-2010-GabbrielliMMS #decidability
Decidability properties for fragments of CHR (MG, JM, MCM, JS), pp. 611–626.
PPDP-2009-GabbrielliMM #on the #power of
On the expressive power of priorities in CHR (MG, JM, MCM), pp. 267–276.
ESOP-2008-GiustoG #abstraction
Full Abstraction for Linda (CDG, MG), pp. 78–92.
PPDP-2007-TacchellaGM
Unfolding in CHR (PT, MG, MCM), pp. 179–186.
ICALP-2005-DelzannoG #composition #constraints #process #theorem proving #verification
Compositional Verification of Asynchronous Processes via Constraint Solving (GD, MG), pp. 1239–1250.
PPDP-2005-DelzannoGM #composition #semantics
A compositional semantics for CHR (GD, MG, MCM), pp. 209–217.
ICALP-2004-BusiGZ #calculus #process #recursion #replication
Comparing Recursion, Replication, and Iteration in Process Calculi (NB, MG, GZ), pp. 307–319.
ICALP-2003-BusiGZ #calculus #recursion #replication
Replication vs. Recursive Definitions in Channel Based Calculi (NB, MG, GZ), pp. 133–144.
ICLP-2003-DelzannoGM #composition #infinity #verification
Compositional Verification of Infinite State Systems (GD, MG, MCM), pp. 47–48.
FoSSaCS-2002-BoerGM #concurrent #constraints #correctness #proving #source code
Proving Correctness of Timed Concurrent Constraint Programs (FSdB, MG, MCM), pp. 37–51.
PPDP-2001-BoerGM #semantics
A Denotational Semantics for Timed Linda (FSdB, MG, MCM), pp. 28–36.
PEPM-1997-EtalleGM #scheduling
A Transformation System for CLP with Dynamic Scheduling and CCP (SE, MG, EM), pp. 137–150.
SAS-1996-BoerGP #constraints #correctness #logic programming #proving #scheduling #source code
Proving Correctness of Constraint Logic Programs with Dynamic Scheduling (FSdB, MG, CP), pp. 83–97.
ICLP-1995-EtalleG #composition #source code
A Transformation System for Modular CLP Programs (SE, MG), pp. 681–695.
ILPS-1995-BoerG #concurrent #constraints #modelling #programming #realtime
Modelling Real-Time in Concurrent Constraint Programming (FSdB, MG), pp. 528–542.
PEPM-1995-EtalleG
The Replacement Operation for CLP Modules (SE, MG), pp. 168–177.
ICLP-1994-AptG #declarative
Declarative Interpretations Reconsidered (KRA, MG), pp. 74–89.
POPL-1994-BoerGMP #concurrent #constraints #proving #source code
Proving Concurrent Constraint Programs Correct (FSdB, MG, EM, CP), pp. 98–108.
SAC-1994-GabbrielliG #analysis #logic programming #source code
Goal independency and call patterns in the analysis of logic programs (MG, RG), pp. 394–399.
POPL-1993-BossiB #difference #logic programming
Differential Logic Programming (AB, MB, MG, GL, MCM), pp. 359–370.
ALP-1992-GabbrielliM #fixpoint #semantics
Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns (MG, MCM), pp. 84–99.
JICSLP-1992-GabbrielliLM #logic programming #source code
Observational Equivalences for Logic Programs (MG, GL, MCM), pp. 131–145.
ICALP-1991-GabbrielliL #logic programming #on the #semantics #source code
On the Semantics of Logic Programs (MG, GL), pp. 1–19.
ICLP-1991-GabbrielliL #constraints #logic programming #modelling #source code
Modeling Answer Constraints in Constraint Logic Programs (MG, GL), pp. 238–252.
PLILP-1991-BrogiG #constraints #logic #process
Constraints for Synchronizing Logic Coarse-grained Sequential Logic Processes (AB, MG), pp. 407–418.
ALP-1990-GabbrielliL #concurrent #constraints #fixpoint #logic programming #semantics #source code
Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs (MG, GL), pp. 204–216.
CAAP-1991-GabbrielliL #algorithm #constraints
A Solved Form Algorithm for Ask and Tell Herbrand Constraints (MG, GL), pp. 320–337.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.