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 × Canada
1 × China
1 × Denmark
1 × Estonia
1 × Greece
1 × India
1 × Israel
1 × Russia
1 × Switzerland
13 × USA
2 × France
2 × Poland
Collaborated with:
M.Sagiv J.A.Medina Y.Diao S.Sagiv S.Patnaik J.Hartmanis T.W.Reps T.Lev-Ami H.Zhang K.Etessami S.Shoham S.Itzhaky G.Yorsh C.Reichenbach Y.Smaragdakis P.Weis W.Hesse M.Adler M.Y.Vardi D.Kozen A.M.Rabinovich O.Padon A.Karbyshev A.Banerjee A.Nanevski O.Lahav Y.Gurevich S.Shelah D.W.Stemple V.Sewelson S.Gulwani J.Agrawal D.Gyllstrom Y.M.Y.Feldman E.Aftandilian S.Z.Guyer D.A.M.Barrington C.Lautemann N.Schweikardt D.Thérien R.Alur M.Arenas P.Barceló L.Libkin S.Srivastava
Talks about:
complex (6) structur (4) logic (4) transit (3) languag (3) complet (3) closur (3) class (3) bound (3) conjectur (2)

Person: Neil Immerman

DBLP DBLP: Immerman:Neil

Contributed to:

POPL 20152015
POPL 20142014
SIGMOD 20142014
CAV 20132013
ECOOP 20122012
OOPSLA 20102010
VLDB 20102010
SIGMOD 20082008
CSL 20072007
LICS 20072007
VMCAI 20072007
CAV 20062006
CADE 20052005
CAV 20042004
CSL 20042004
LICS 20022002
LICS 20012001
CAV 19971997
LICS 19961996
LICS 19951995
LICS 19941994
PODS 19941994
PODS 19911991
LICS 19871987
ICALP 19851985
STOC 19831983
STOC 19821982
POPL 20162016
POPL 20202020

Wrote 33 papers:

POPL-2015-PadonIKLSS #policy
Decentralizing SDN Policies (OP, NI, AK, OL, MS, SS), pp. 663–676.
POPL-2014-ItzhakyBILNS #composition #effectiveness #reasoning
Modular reasoning about heap paths via effectively propositional formulas (SI, AB, NI, OL, AN, MS), pp. 385–396.
SIGMOD-2014-ZhangDI #complexity #on the #optimisation #query
On complexity and optimization of expensive queries in complex event processing (HZ, YD, NI), pp. 217–228.
CAV-2013-ItzhakyBINS #data type #effectiveness #linked data #open data #reachability #reasoning
Effectively-Propositional Reasoning about Reachability in Linked Data Structures (SI, AB, NI, AN, MS), pp. 756–772.
ECOOP-2012-ReichenbachSI #java #named #parallel #programming
PQL: A Purely-Declarative Java Extension for Parallel Programming (CR, YS, NI), pp. 53–78.
OOPSLA-2010-ItzhakyGIS #induction #synthesis
A simple inductive synthesis methodology and its applications (SI, SG, NI, MS), pp. 36–46.
OOPSLA-2010-ReichenbachISAG #garbage collection #what
What can the GC compute efficiently?: a language for heap assertions at GC time (CR, NI, YS, EA, SZG), pp. 256–269.
VLDB-2010-ZhangDI
Recognizing Patterns in Streams with Imprecise Timestamps (HZ, YD, NI), pp. 244–255.
SIGMOD-2008-AgrawalDGI #pattern matching #performance
Efficient pattern matching over event streams (JA, YD, DG, NI), pp. 147–160.
CSL-2007-WeisI #strict #theorem #word
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words (PW, NI), pp. 343–357.
LICS-2007-AlurABEIL #first-order #logic #word
First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.
VMCAI-2007-Lev-AmiSIR #analysis
Constructing Specialized Shape Analyses for Uniform Change (TLA, MS, NI, TWR), pp. 215–233.
CAV-2006-Lev-AmiIS #abstraction #analysis #performance #precise
Abstraction for Shape Analysis with Fast and Precise Transformers (TLA, NI, SS), pp. 547–561.
CADE-2005-Lev-AmiIRSSY #data type #first-order #linked data #logic #open data #reachability #simulation #using #verification
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (TLA, NI, TWR, SS, SS, GY), pp. 99–115.
CAV-2004-ImmermanRRSY #simulation #verification
Verification via Structure Simulation (NI, AMR, TWR, SS, GY), pp. 281–294.
CSL-2004-ImmermanRRSY #bound #decidability #logic #transitive
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (NI, AMR, TWR, SS, GY), pp. 160–174.
LICS-2002-HesseI #complexity #problem
Complete Problems for Dynamic Complexity Classes (WH, NI), p. 313–?.
LICS-2001-AdlerI #bound #exclamation
An n! Lower Bound on Formula Size (MA, NI), pp. 197–206.
LICS-2001-BarringtonILST
The Crane Beach Conjecture (DAMB, NI, CL, NS, DT), pp. 187–196.
CAV-1997-ImmermanV #logic #model checking #transitive
Model Checking and Transitive-Closure Logic (NI, MYV), pp. 291–302.
LICS-1996-MedinaI #theorem
A Generalization of Fagin’s Theorem (JAM, NI), pp. 2–12.
LICS-1995-EtessamiI #transitive
Tree Canonization and Transitive Closure (KE, NI), pp. 331–341.
LICS-1994-GurevichIS
McColm’s Conjecture (YG, NI, SS), pp. 10–19.
LICS-1994-MedinaI
A Syntactic Characterization of NP-Completeness (JAM, NI), pp. 241–250.
PODS-1994-PatnaikI #complexity #named #parallel
Dyn-FO: A Parallel, Dynamic Complexity Class (SP, NI), pp. 210–221.
PODS-1991-ImmermanPS #finite #product line #set
The Expressiveness of a Family of Finite Set Languages (NI, SP, DWS), pp. 37–52.
LICS-1987-ImmermanK #bound
Definability with Bounded Number of Bound Variables (NI, DK), pp. 236–244.
ICALP-1985-HartmanisI #on the #problem
On Complete Problems for NP∩CoNP (JH, NI), pp. 250–259.
STOC-1983-HartmanisSI #set
Sparse Sets in NP-P: EXPTIME versus NEXPTIME (JH, VS, NI), pp. 382–391.
STOC-1983-Immerman #complexity
Languages Which Capture Complexity Classes (NI), pp. 347–354.
STOC-1982-Immerman #polynomial #query #relational
Relational Queries Computable in Polynomial Time (NI), pp. 147–152.
POPL-2016-PadonISKS #decidability #induction #invariant
Decidability of inferring inductive invariants (OP, NI, SS, AK, MS), pp. 217–231.
POPL-2020-FeldmanISS #complexity #invariant
Complexity and information in invariant inference (YMYF, NI, MS, SS), p. 29.

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.