Pages that link to "Item:Q163528"

The following pages link to Electronic Notes in Theoretical Computer Science (Q163528):

Displaying 50 items.

• Proceedings of the fourth workshop on logical and semantic frameworks, with applications (LSFA 2009), Brasilia, Brazil, August 28, 2009 (Q2435210) (← links)
• Proceedings of the fifth international symposium on domain theory (ISDT 2009), Shanghai, China, September 12--14, 2009 (Q2435261) (← links)
• Proceedings of the 9th Spanish conference on programming and computer languages (PROLE 2009), San Sebastián, Spain, September 9--11, 2009 (Q2435262) (← links)
• Proceedings of the 6th international workshop on automated verification of critical systems (AVoCS 2006), Nancy, France, September 18--19, 2006 (Q2435353) (← links)
• Proceedings of the 7th international workshop on automated verification of critical systems (AVoCS 2007), Oxford, UK, September 10--12, 2007 (Q2435354) (← links)
• Proceedings of the 8th international workshop on automated verification of critical systems (AVoCS 2008), Glasgow, UK, September 30 -- October 1, 2008 (Q2435361) (← links)
• Proceedings of the 2nd international workshop on numerical and symbolic abstract domains: NSAD 2010, Perpignan, France, September 13, 2010 (Q2440899) (← links)
• Proceedings of the 1st international workshop on static analysis and systems biology (SASB 2010), Perpignan, France, September 13, 2010 (Q2440900) (← links)
• Post-proceedings of the 2nd international workshop on interactions between computer science and biology (CS2Bio'11), Reykjavik, Iceland, June 9, 2011 (Q2440901) (← links)
• Proceedings of the 11th Spanish conference on programming and languages, PROLE 2011, Coruña, Spain, September 5--7, 2011 (Q2440902) (← links)
• Proceedings of the 9th international workshop on user interfaces for theorem provers (UITP10), Edinburgh, UK, July 15, 2010 (Q2440903) (← links)
• Proceedings of the 4th international workshop on numerical and symbolic abstract domains, NSAD 2012, Deauville, France, September 10, 2012 (Q2440904) (← links)
• Proceedings of the 3rd international workshop on numerical and symbolic abstract domains, NSAD 2011, Venice, Italy, September 13, 2011 (Q2440905) (← links)
• 9th international workshop on rule-based programming (Rule 2008), Hagenberg Castle, Hagenberg, Austria, July 14--18, 2008 (Q2440936) (← links)
• Continuous domains in logical form (Q2577617) (← links)
• Proceedings of the 31st conference on the mathematical foundations of programming semantics (MFPS XXXI), Nijmegen, The Netherlands, June 22--25, 2015 (Q2629519) (← links)
• Proceedings of ICTCS 2015, the 16th Italian conference on theoretical computer science, Firenze, Italy, September 9--11, 2015 (Q2629555) (← links)
• Proceedings of the 10th Spanish conference on programming and languages (PROLE 2010), Valencia, Spain, September 8--10, 2010 (Q2637335) (← links)
• Proceedings of the 27th conference on the mathematical foundations of programming semantics (MFPS XXVII), Pittsburgh, PA, USA, May 25--28, 2011 (Q2637336) (← links)
• Proceedings of the 7th workshop on methods for modalities (M4M'2011), and the 4th workshop on logical aspects of multi-agent systems (LAMAS'2011), Osuna, Spain, November 10--12, 2011 (Q2637337) (← links)
• Proceedings of the 9th workshop on geometric and topological methods in computer science (GETCO), Aalborg, Denmark, January 11--15, 2010 (Q2637338) (← links)
• Proceedings of the 2nd international workshop on static analysis and systems biology (SASB 2011), Venice, Italy, September 13, 2011 (Q2637339) (← links)
• Proceedings of the 28th conference on the mathematical foundations of programming semantics (MFPS XXVIII), Bath, UK, June 6--9, 2012 (Q2637340) (← links)
• Proceedings of the 3rd international conference on computability and complexity in analysis (CCA 2006), Gainesville, FL, USA, November 1--5, 2006 (Q2642846) (← links)
• Proceedings of the 13th workshop on logic, language, information and computation (WoLLIC 2006), Stanford, CA, USA, July 18--21, 2006 (Q2642847) (← links)
• Multiparty contract signing over a reliable network (Q2804932) (← links)
• A formalization of credit and responsibility within the GNDC schema (Q2804933) (← links)
• A new Rabin-type trapdoor permutation equivalent to factoring (Q2804935) (← links)
• Nonmonotonic trust management for P2P applications (Q2804936) (← links)
• On the expressivity of minimal generic quantification (Q2804937) (← links)
• Type theory should eat itself (Q2804938) (← links)
• A simple nominal type theory (Q2804939) (← links)
• Explicit contexts in LF (extended abstract) (Q2804940) (← links)
• Case analysis of higher-order data (Q2804942) (← links)
• Reasoning in Abella about structural operational semantics specifications (Q2804943) (← links)
• Inductive completeness of logics of programs (Q2804944) (← links)
• On the role of names in reasoning about \(\lambda\)-tree syntax specifications (Q2804945) (← links)
• Continuous functions on final coalgebras (Q2805147) (← links)
• Abstract interpretation from a denotational-semantics perspective (Q2805148) (← links)
• Monoidal indeterminates and categories of possible worlds (Q2805149) (← links)
• Another look at function domains (Q2805150) (← links)
• Quantitative notions of leakage for one-try attacks (Q2805152) (← links)
• Extending algebraic operations to D-completions. (Q2805153) (← links)
• Some programming languages suggested by game models (extended abstract) (Q2805154) (← links)
• Game semantics for access control (Q2805155) (← links)
• On the failure of fixed-point theorems for chain-complete lattices in the effective topos (Q2805156) (← links)
• A context-based approach to proving termination of evaluation (Q2805157) (← links)
• Categories of timed stochastic relations (Q2805158) (← links)
• Semi-decidability of may, must and probabilistic testing in a higher-type setting (Q2805159) (← links)
• On the unification of process semantics: equational semantics (Q2805160) (← links)