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 × Austria
1 × Germany
1 × Sweden
3 × Italy
Collaborated with:
O.Grinchtein P.Flener M.Carlsson K.Balck J.He T.Mancini M.Ågren G.Behrmann K.G.Larsen C.Weise W.Yi
Talks about:
constraint (4) protocol (3) analysi (3) model (3) log (3) combinatori (2) telecommun (2) problem (2) search (2) relat (2)

Person: Justin Pearson

DBLP DBLP: Pearson:Justin

Contributed to:

TAP 20152015
DATE 20142014
SMT 20142014
SAC 20122012
LOPSTR 20032003
CAV 19991999

Wrote 7 papers:

TAP-2015-GrinchteinCP #analysis #constraints #optimisation #protocol
A Constraint Optimisation Model for Analysis of Telecommunication Protocol Logs (OG, MC, JP), pp. 137–154.
DATE-2014-BalckGP #generative #modelling #protocol #testing #using
Model-based protocol log generation for testing a telecommunication test harness using CLP (KB, OG, JP), pp. 1–4.
SMT-2014-CarlssonGP #analysis #constraints #programming #protocol
Protocol Log Analysis with Constraint Programming (MC, OG, JP), pp. 17–26.
SAC-2012-HeFP #constraints
Solution neighbourhoods for constraint-directed local search (JH, PF, JP), pp. 74–79.
SAC-2012-ManciniFP #combinator #constraints #database #problem #relational #synthesis
Combinatorial problem solving over relational databases: view synthesis through constraint-based local search (TM, PF, JP), pp. 80–87.
LOPSTR-2003-FlenerPA #combinator #modelling #problem #relational
Introducing esra, a Relational Language for Modelling Combinatorial Problems (PF, JP, ), pp. 214–232.
CAV-1999-BehrmannLPWY #analysis #diagrams #difference #performance #reachability #using
Efficient Timed Reachability Analysis Using Clock Difference Diagrams (GB, KGL, JP, CW, WY), pp. 341–353.

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.