Search results for "realizability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Zlatan Damnjanovic	Elementary realizability.	J. Philos. Log.	1997	DBLP DOI BibTeX RDF
17	Anatoly Petrovich Beltiukov	Intuitionistic Formal Theories with Realizability in Subrecursive Classes.	Ann. Pure Appl. Log.	1997	DBLP DOI BibTeX RDF
17	Jaap van Oosten	Extensional Realizability.	Ann. Pure Appl. Log.	1997	DBLP DOI BibTeX RDF
17	Jaap van Oosten	Two Remarks on the Lifschitz Realizability Topos.	J. Symb. Log.	1996	DBLP DOI BibTeX RDF
17	James Lipton, Michael J. O'Donnell	Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.	Ann. Pure Appl. Log.	1996	DBLP DOI BibTeX RDF
17	Michael B. Dillencourt, Warren D. Smith	Graph-theoretical conditions for inscribability and Delaunay realizability.	Discret. Math.	1996	DBLP DOI BibTeX RDF
17	Zlatan Damnjanovic	Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis.	J. Symb. Log.	1995	DBLP DOI BibTeX RDF
17	Jean H. Gallier	Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
17	S. C. Leung, Hon Fung Li	On the realizability and synthesis of delay-insensitive behaviors.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
17	Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann, Antonius A. C. M. Kalker	On the realizability of biorthogonal, m-dimensional two-band filter banks.	IEEE Trans. Signal Process.	1995	DBLP DOI BibTeX RDF
17	Peter Eades, Sue Whitesides	Nearest Neighbour Graph Realizability is NP-hard.	LATIN	1995	DBLP DOI BibTeX RDF
17	John R. Longley	Realizability toposes and language semantics.		1995	RDF
17	Kokichi Sugihara	Simpler Proof of a Realizability Theorem on Delaunay Triangulations.	Inf. Process. Lett.	1994	DBLP DOI BibTeX RDF
17	Zlatan Damnjanovic	Strictly Primitive Recursive Realizability, I.	J. Symb. Log.	1994	DBLP DOI BibTeX RDF
17	Satoshi Kobayashi, Makoto Tatsuta	Realizability Interpretation of Generalized Inductive Definitions.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
17	Makoto Tatsuta	Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
17	John N. Crossley, Gerald L. Mathai, Robert A. G. Seely	A logical calculus for polynomial-time realizability.	Methods Log. Comput. Sci.	1994	DBLP BibTeX RDF
17	Duen-Jeng Wang, Yu Hen Hu	Fully static multiprocessor array realizability criteria for real-time recurrent DSP applications.	IEEE Trans. Signal Process.	1994	DBLP DOI BibTeX RDF
17	Makoto Tatsuta	Two Realizability Interpretations of Monotone Inductive Definitions.	Int. J. Found. Comput. Sci.	1994	DBLP DOI BibTeX RDF
17	Jaap van Oosten	Axiomatizing Higher-Order Kleene Realizability.	Ann. Pure Appl. Log.	1994	DBLP DOI BibTeX RDF
17	Martin Aigner 0001, Eberhard Triesch	Realizability and uniqueness in graphs.	Discret. Math.	1994	DBLP DOI BibTeX RDF
17	Franco Barbanera, Simone Martini 0001	Proof-functional connectives and realizability.	Arch. Math. Log.	1994	DBLP DOI BibTeX RDF
17	Michael B. Dillencourt, Warren D. Smith	Graph-Theoretical Conditions for Inscribability and Delaunay Realizability.	CCCG	1994	DBLP BibTeX RDF
17	Hon Fung Li, S. C. Leung	An efficient algorithm for the realizability analysis of signal transition graphs.	Great Lakes Symposium on VLSI	1994	DBLP DOI BibTeX RDF
17	J. M. E. Hyland, C.-H. Luke Ong	Modified Realizability Toposes and Strong Normalization Proofs.	TLCA	1993	DBLP DOI BibTeX RDF
17	Sanjay G. Dhande, K. P. Karunakaran	Realizability in Computer Aided Design.	ICCG	1993	DBLP BibTeX RDF
17	Thorsten Altenkirch	Proving Strong Normalization of CC by Modifying Realizability Semantics.	TYPES	1993	DBLP DOI BibTeX RDF
17	Victor Harnik, Michael Makkai	Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability.	J. Symb. Log.	1992	DBLP DOI BibTeX RDF
17	Makoto Tatsuta	Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams.	FGCS	1992	DBLP BibTeX RDF
17	Ali Hamie	Realizability and partiality in constructive set theories.		1992	RDF
17	Jaap van Oosten	Extension of Lifschitz' Realizability to Higher Order Arithmetic, and a Solution to a Problem of F. Richman.	J. Symb. Log.	1991	DBLP DOI BibTeX RDF
17	Makoto Tatsuta	Program Synthesis Using Realizability.	Theor. Comput. Sci.	1991	DBLP BibTeX RDF
17	Roberto M. Amadio	Recursion over Realizability Structures	Inf. Comput.	1991	DBLP DOI BibTeX RDF
17	James Lipton	Kripke Semantics for Dependent Type Theory and Realizability Interpretations.	Constructivity in Computer Science	1991	DBLP DOI BibTeX RDF
17	Makoto Tatsuta	Monotone Recursive Definition of Predicates and Its Realizability Interpretation.	TACS	1991	DBLP DOI BibTeX RDF
17	Vladimir Batagelj, Tomaz Pisanski, J. M. S. Simões-Pereira	An algorithm for tree-realizability of distance matrices.	Int. J. Comput. Math.	1990	DBLP DOI BibTeX RDF
17	Michael B. Dillencourt	Realizability of Delaunay Triangulations.	Inf. Process. Lett.	1990	DBLP DOI BibTeX RDF
17	Jaap van Oosten	Lifschitz' Realizability.	J. Symb. Log.	1990	DBLP DOI BibTeX RDF
17	Grigori Mints	The Completeness of Provable Realizability.	Notre Dame J. Formal Log.	1989	DBLP DOI BibTeX RDF
17	Martin C. Henson	Realizability Models for Program Construction.	MPC	1989	DBLP DOI BibTeX RDF
17	Aurelio Carboni, Peter J. Freyd, Andre Scedrov	A Categorical Approach to Realizability and Polymorphic Types.	MFPS	1987	DBLP DOI BibTeX RDF
17	Nicolas D. Goodman	Flagg Realizability in Arithmetic.	J. Symb. Log.	1986	DBLP DOI BibTeX RDF
17	Charles McCarty	Subcountability under realizability.	Notre Dame J. Formal Log.	1986	DBLP DOI BibTeX RDF
17	Charles McCarty	Realizability and recursive set theory.	Ann. Pure Appl. Log.	1986	DBLP DOI BibTeX RDF
17	Manfred E. Szabo	The Continuous Realizability of Entailment.	Math. Log. Q.	1983	DBLP DOI BibTeX RDF
17	Charles McCarty	Information Systems, Continuity and Realizability.	Logic of Programs	1983	DBLP DOI BibTeX RDF
17	Francis T. Boesch, Charles L. Suffel	Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree.	Networks	1982	DBLP DOI BibTeX RDF
17	Francis T. Boesch, Charles L. Suffel	Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity.	Discret. Appl. Math.	1981	DBLP DOI BibTeX RDF
17	Masato Inagaki, Yasuyuki Funahashi	Nonisomorphic classes of inhomogeneous bilinear realizations: Realizability and existence.	Autom.	1980	DBLP DOI BibTeX RDF
17	Francis T. Boesch, Charles L. Suffel	Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity.	J. Graph Theory	1980	DBLP DOI BibTeX RDF
17	B. I. Strom	Proof of the Equivalent Realizability of a Time-Bound Arbiter and a Runt-Free Inertail Delay.	ISCA	1979	DBLP DOI BibTeX RDF
17	Nicolas D. Goodman	Relativized Realizability in Intuitionistic Arithmetic of All Finite Types.	J. Symb. Log.	1978	DBLP DOI BibTeX RDF
17	Francis T. Boesch, Frank Harary	Unicyclic realizability of a degree list.	Networks	1978	DBLP DOI BibTeX RDF
17	Bruno Scarpellini	A New Realizability Notion for Intuitionistic Analysis.	Math. Log. Q.	1977	DBLP DOI BibTeX RDF
17	Yasuhiko Takahara, Mihajlo D. Mesarovic	Realizability and general dynamical systems.	Inf. Sci.	1975	DBLP DOI BibTeX RDF
17	Subir Bandyopadhyay, A. Pal, Arun K. Choudhury	Characterization of Unate Cascade Realizability Using Parameters.	IEEE Trans. Computers	1975	DBLP DOI BibTeX RDF
17	John Staples	Combinator Realizability of a Constructive Morse Set Theory.	J. Symb. Log.	1974	DBLP DOI BibTeX RDF
17	Robert R. Tompkins	On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory.	Notre Dame J. Formal Log.	1968	DBLP DOI BibTeX RDF
17	Leo Hellerman, William L. Duda, Shmuel Winograd	Continuity and Realizability of Sequence Transformations.	IEEE Trans. Electron. Comput.	1966	DBLP DOI BibTeX RDF
17	Wesley W. Chu	Correction [to "On the realizability of special classes of autonomous sequential networks"].	IEEE Trans. Electron. Comput.	1966	DBLP DOI BibTeX RDF
17	Vladimír Strejc	The physical realizability of an optimum Ν-parameter, discrete, linear control system determined in Wiener's sense.	Kybernetika	1965	DBLP BibTeX RDF
17	Franco P. Preparata	On the Realizability of Special Classes of Autonomous Sequential Networks.	IEEE Trans. Electron. Comput.	1965	DBLP DOI BibTeX RDF
17	Robert O. Winder	Bounds on Threshold Gate Realizability.	IEEE Trans. Electron. Comput.	1963	DBLP DOI BibTeX RDF
17	Manohar Lal	On Physical Realizability of Signal Flow Graphs and Realization Techniques		1963	RDF
17	Saburo Muroga	Functional forms of majority functions and a necessary and sufficient condition for their realizability	SWCT	1961	DBLP DOI BibTeX RDF
13	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	From liveness to promptness.	Formal Methods Syst. Des.	2009	DBLP DOI BibTeX RDF	Verification, Temporal logic, Liveness
13	Tevfik Bultan, Chris Ferguson, Xiang Fu 0001	A Tool for Choreography Analysis Using Collaboration Diagrams.	ICWS	2009	DBLP DOI BibTeX RDF
13	Thierry Coquand	Forcing and Type Theory.	CSL	2009	DBLP DOI BibTeX RDF
13	Hillel Kugler, Cory Plock, Amir Pnueli	Controller Synthesis from LSC Requirements.	FASE	2009	DBLP DOI BibTeX RDF
13	Stefan Felsner, Sarah Kappes	Orthogonal Surfaces and Their CP-Orders.	Order	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C62, 52B05, 68R10, 06A07
13	Sumanta Chaudhuri, Jean-Luc Danger, Philippe Hoogvorst, Sylvain Guilley	Efficient tiling patterns for reconfigurable gate arrays.	FPGA	2008	DBLP DOI BibTeX RDF	FPGA hexagonal octagonal, tiling interconnect
13	Kevin M. Lillis, Sriram V. Pemmaraju	On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations.	WEA	2008	DBLP DOI BibTeX RDF
13	Sylvain Lebresne	A System F with Call-by-Name Exceptions.	ICALP (2)	2008	DBLP DOI BibTeX RDF
13	Kun Liu 0001, Evimaria Terzi	Towards identity anonymization on graphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	degree sequence, dynamic programming, anonymity
13	K. Yang, Michael R. Frater, Elanor H. Huntington, Mark R. Pickering, John F. Arnold	Generalized framework for reduced precision global motion estimation between digital images.	MMSP	2008	DBLP DOI BibTeX RDF
13	Werner Damm	Contract-Based Analysis of Automotive and Avionics Applications: The SPEEDS Approach.	FMICS	2008	DBLP DOI BibTeX RDF
13	Dana Fisman, Orna Kupferman, Sarai Sheinvald-Faragy, Moshe Y. Vardi	A Framework for Inherent Vacuity.	Haifa Verification Conference	2008	DBLP DOI BibTeX RDF
13	Yang Cheung, Dah-Ming Chiu, Jianwei Huang 0001	Can Bilateral ISP Peering Lead to Network-Wide Cooperative Settlement.	ICCCN	2008	DBLP DOI BibTeX RDF
13	Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann	Environment Assumptions for Synthesis.	CONCUR	2008	DBLP DOI BibTeX RDF
13	Stefano Berardi, Ugo de'Liguoro	A Calculus of Realizers for EM1 Arithmetic (Extended Abstract).	CSL	2008	DBLP DOI BibTeX RDF
13	Manoj Prabhakaran 0001, Mike Rosulek	Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations.	CRYPTO	2008	DBLP DOI BibTeX RDF
13	K. Yang, Michael R. Frater, Elanor H. Huntington, Mark R. Pickering, John F. Arnold	Low Precision Global Motion Estimation for Video Compression- A Generalized Framework.	DICTA	2008	DBLP DOI BibTeX RDF
13	Paulo Oliva	Computational Interpretations of Classical Linear Logic.	WoLLIC	2007	DBLP DOI BibTeX RDF
13	Roderick Bloem, Roberto Cavada, Ingo Pill, Marco Roveri, Andrei Tchaltsev	RAT: A Tool for the Formal Analysis of Requirements.	CAV	2007	DBLP DOI BibTeX RDF
13	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	From Liveness to Promptness.	CAV	2007	DBLP DOI BibTeX RDF
13	Marc Herbstritt, Vanessa Struve, Bernd Becker 0001	Application of Lifting in Partial Design Analysis.	MTV	2007	DBLP DOI BibTeX RDF
13	Mikhail M. Svinin, Shigeyuki Hosoe	On the dynamics and motion planning for a rolling system With variable inertia.	IROS	2007	DBLP DOI BibTeX RDF
13	Wojciech Moczydlowski	A Dependent Set Theory.	LICS	2007	DBLP DOI BibTeX RDF
13	Liang Chang 0003, Fen Lin, Zhongzhi Shi	A Dynamic Description Logic for Representation and Reasoning About Actions.	KSEM	2007	DBLP DOI BibTeX RDF
13	Brian F. Redmond	Multiplexor Categories and Models of Soft Linear Logic.	LFCS	2007	DBLP DOI BibTeX RDF	Categorical semantics, Soft Linear Logic, Polynomial time, Game semantics
13	Andrej Bauer, Christopher A. Stone	RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice.	CiE	2007	DBLP DOI BibTeX RDF
13	Vandana Gunupudi, Stephen R. Tate	Random Oracle Instantiation in Distributed Protocols Using Trusted Platform Modules.	AINA Workshops (1)	2007	DBLP DOI BibTeX RDF
13	Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli 0001, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta	On the Topologies of Local Minimum Spanning Trees.	CAAN	2006	DBLP DOI BibTeX RDF
13	Lars Schewe	Generation of Oriented Matroids Using Satisfiability Solvers.	ICMS	2006	DBLP DOI BibTeX RDF
13	Thilo Streichert, Christian Strengert, Christian Haubelt, Jürgen Teich	Dynamic task binding for hardware/software reconfigurable networks.	SBCCI	2006	DBLP DOI BibTeX RDF	online hardware/software partitioning, fault-tolerance, reconfigurable system
13	Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer 0001, Michael Schulz 0001	Simultaneous Graph Embeddings with Fixed Edges.	WG	2006	DBLP DOI BibTeX RDF
13	Valery Plisko	On Primitive Recursive Realizabilities.	CSR	2006	DBLP DOI BibTeX RDF
13	Robert L. Constable, Wojciech Moczydlowski	Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics.	IJCAR	2006	DBLP DOI BibTeX RDF
13	Ulrik Brandes, Barbara Schlieper	Angle and Distance Constraints on Tree Drawings.	GD	2006	DBLP DOI BibTeX RDF
13	Claire Monteleoni	Efficient Algorithms for General Active Learning.	COLT	2006	DBLP DOI BibTeX RDF