Name
Affiliation
Papers
JOHN HUGHES
Department of Computer Science, Chalmers Technical University, S-41296 Göteborg, Sweden
57
Collaborators
Citations 
PageRank 
59
1573
174.22
Referers 
Referees 
References 
2171
737
535
Search Limit
1001000
Title
Citations
PageRank
Year
Understanding formal specifications through good examples.00.342018
Branching Processes for QuickCheck Generators.10.352018
Special section on functional paradigm for high performance computing.00.342018
Typing the wild in Erlang.00.342018
Beginner's Luck: A Language for Property-Based Generators.00.342017
Modelling Of Autosar Libraries For Large Scale Testing00.342017
Find more bugs with QuickCheck!20.372016
How Well are Your Requirements Tested?20.392016
Experiences with QuickCheck: Testing the Hard Stuff and Staying Sane.10.352016
Automatic Grading of Programming Exercises using Property-Based Testing.40.562016
Mysteries of DropBox: Property-Based Testing of a Distributed Synchronization Service60.432016
Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System.50.422015
Graphical editing support for QuickCheck models00.342015
Testing AUTOSAR software with QuickCheck220.842015
Linking unit tests and properties30.412015
An Expressive Semantics of Mocking50.682014
Toward a mature industrial practice of software test automation00.342014
Testing Noninterference, Quickly.60.492013
Specification based testing with QuickCheck: tutorial talk00.342011
Testing an optimising compiler by generating random lambda terms331.462011
Using temporal relations to specify and test an instant messaging server30.452010
QuickSpec: guessing formal specifications using testing331.432010
Property-based testing: the ProTest project90.582009
Testing Erlang data types with quviq quickcheck221.152008
Experiences from teaching functional programming at Chalmers20.402008
A Library for Secure Multi-threaded Information Flow in Haskell170.682007
QuickCheck testing for fun and profit462.022007
Global variables in Haskell40.462004
Programming with Arrows100.782004
Polish parsers, step by step100.682003
Testing monadic code with QuickCheck281.722002
Principal type specialisation10.362002
Binding-Time Analysis for Polymorphic Types30.392001
Extending a partial evaluator which supports separate compilation20.372000
QuickCheck: a lightweight tool for random testing of Haskell programs.00.342000
The Correctness of Type Specialisation30.432000
Generalising monads to arrows17410.292000
QuickCheck: a lightweight tool for random testing of Haskell programs51226.072000
Type specialization40.451998
Partial evaluation and separate compilation30.461997
Module-sensitive program specialisation00.341997
Type Specialisation for the lambda-Calculus; or, A New Paradigm for Partial Evaluation Based on Type Inference231.081996
Advanced Functional Programming: First International Spring School on Advanced Functional Programming Techniques, Bastad, Sweden, May 24-30, 1995: Tutorial Text107.431995
Fast Abstract Interpretation Using Sequential Algorithms80.631993
Pretty-printing: An Exercise in Functional Programming10.441992
Abstract Interpretation of Higher Order Functions Using Concrete Data Structures (Summary)10.381992
A Loop-Detecting Interpreter for Lazy Programs10.451991
Abstract Interpretation of Polymorphic Functions40.581989
An Iterative Powerdomain Construction30.601989
Projections for Polymorphic Strictness Analysis91.891989
  • 1
  • 2